./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f --- 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-2329fc7 [2022-12-14 15:23:06,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:23:06,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:23:06,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:23:06,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:23:06,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:23:06,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:23:06,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:23:06,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:23:06,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:23:06,042 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:23:06,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:23:06,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:23:06,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:23:06,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:23:06,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:23:06,051 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:23:06,052 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:23:06,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:23:06,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:23:06,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:23:06,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:23:06,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:23:06,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:23:06,064 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:23:06,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:23:06,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:23:06,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:23:06,066 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:23:06,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:23:06,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:23:06,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:23:06,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:23:06,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:23:06,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:23:06,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:23:06,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:23:06,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:23:06,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:23:06,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:23:06,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:23:06,075 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-12-14 15:23:06,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:23:06,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:23:06,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:23:06,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:23:06,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:23:06,099 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:23:06,099 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:23:06,100 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:23:06,100 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:23:06,100 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:23:06,100 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:23:06,100 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:23:06,100 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:23:06,101 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:23:06,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:23:06,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:23:06,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:23:06,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:23:06,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:23:06,104 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh 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 ! overflow) ) 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 -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2022-12-14 15:23:06,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:23:06,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:23:06,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:23:06,282 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:23:06,282 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:23:06,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-12-14 15:23:08,876 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:23:09,082 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:23:09,083 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-12-14 15:23:09,092 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/data/38ec4f43c/635f912c6d164a0bbd7229f6927c4fc6/FLAG07d5b62fb [2022-12-14 15:23:09,103 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/data/38ec4f43c/635f912c6d164a0bbd7229f6927c4fc6 [2022-12-14 15:23:09,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:23:09,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:23:09,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:23:09,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:23:09,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:23:09,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca4dc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09, skipping insertion in model container [2022-12-14 15:23:09,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:23:09,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:23:09,298 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:23:09,581 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-12-14 15:23:09,583 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-12-14 15:23:09,583 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-12-14 15:23:09,644 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-12-14 15:23:09,645 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-12-14 15:23:09,647 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-12-14 15:23:09,648 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-12-14 15:23:09,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:23:09,665 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:23:09,677 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-14 15:23:09,698 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-12-14 15:23:09,699 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-12-14 15:23:09,700 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-12-14 15:23:09,711 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-12-14 15:23:09,711 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-12-14 15:23:09,713 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-12-14 15:23:09,713 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_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-12-14 15:23:09,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:23:09,800 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:23:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09 WrapperNode [2022-12-14 15:23:09,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:23:09,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:23:09,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:23:09,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:23:09,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,827 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,853 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 229 [2022-12-14 15:23:09,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:23:09,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:23:09,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:23:09,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:23:09,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,886 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:23:09,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:23:09,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:23:09,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:23:09,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (1/1) ... [2022-12-14 15:23:09,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:23:09,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:09,914 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:23:09,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-12-14 15:23:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-12-14 15:23:09,952 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:23:09,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:23:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-14 15:23:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 15:23:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 15:23:09,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:23:09,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:23:09,955 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 15:23:10,080 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:23:10,083 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:23:10,409 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:23:10,419 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:23:10,419 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-14 15:23:10,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:23:10 BoogieIcfgContainer [2022-12-14 15:23:10,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:23:10,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:23:10,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:23:10,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:23:10,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:23:09" (1/3) ... [2022-12-14 15:23:10,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1def49cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:23:10, skipping insertion in model container [2022-12-14 15:23:10,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:23:09" (2/3) ... [2022-12-14 15:23:10,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1def49cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:23:10, skipping insertion in model container [2022-12-14 15:23:10,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:23:10" (3/3) ... [2022-12-14 15:23:10,428 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-12-14 15:23:10,436 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 15:23:10,445 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:23:10,445 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-12-14 15:23:10,445 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 15:23:10,537 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-14 15:23:10,571 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 15:23:10,584 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 271 places, 281 transitions, 578 flow [2022-12-14 15:23:10,586 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 271 places, 281 transitions, 578 flow [2022-12-14 15:23:10,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 271 places, 281 transitions, 578 flow [2022-12-14 15:23:10,686 INFO L130 PetriNetUnfolder]: 17/279 cut-off events. [2022-12-14 15:23:10,687 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-14 15:23:10,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 279 events. 17/279 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 623 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 227. Up to 2 conditions per place. [2022-12-14 15:23:10,704 INFO L119 LiptonReduction]: Number of co-enabled transitions 31780 [2022-12-14 15:23:16,360 INFO L134 LiptonReduction]: Checked pairs total: 66505 [2022-12-14 15:23:16,360 INFO L136 LiptonReduction]: Total number of compositions: 273 [2022-12-14 15:23:16,365 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 80 places, 83 transitions, 182 flow [2022-12-14 15:23:16,574 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9815 states, 8925 states have (on average 3.6401120448179274) internal successors, (32488), 9814 states have internal predecessors, (32488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:16,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:23:16,592 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;@4a1631d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:23:16,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-12-14 15:23:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 9815 states, 8925 states have (on average 3.6401120448179274) internal successors, (32488), 9814 states have internal predecessors, (32488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:23:16,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:16,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:23:16,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:16,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:16,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2127311225, now seen corresponding path program 1 times [2022-12-14 15:23:16,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:16,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632042771] [2022-12-14 15:23:16,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:16,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:16,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:16,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632042771] [2022-12-14 15:23:16,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632042771] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:16,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:16,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:23:16,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139368625] [2022-12-14 15:23:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:16,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 15:23:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:16,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 15:23:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:23:16,796 INFO L87 Difference]: Start difference. First operand has 9815 states, 8925 states have (on average 3.6401120448179274) internal successors, (32488), 9814 states have internal predecessors, (32488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:17,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:17,025 INFO L93 Difference]: Finished difference Result 8181 states and 25987 transitions. [2022-12-14 15:23:17,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 15:23:17,028 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:23:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:17,081 INFO L225 Difference]: With dead ends: 8181 [2022-12-14 15:23:17,082 INFO L226 Difference]: Without dead ends: 8181 [2022-12-14 15:23:17,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 15:23:17,084 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:17,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:23:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8181 states. [2022-12-14 15:23:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8181 to 8181. [2022-12-14 15:23:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 7606 states have (on average 3.4166447541414673) internal successors, (25987), 8180 states have internal predecessors, (25987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 25987 transitions. [2022-12-14 15:23:17,482 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 25987 transitions. Word has length 6 [2022-12-14 15:23:17,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:17,483 INFO L495 AbstractCegarLoop]: Abstraction has 8181 states and 25987 transitions. [2022-12-14 15:23:17,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 6.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 25987 transitions. [2022-12-14 15:23:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:23:17,484 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:17,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:23:17,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:23:17,485 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:17,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:17,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2127311257, now seen corresponding path program 1 times [2022-12-14 15:23:17,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:17,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552598305] [2022-12-14 15:23:17,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:17,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:17,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552598305] [2022-12-14 15:23:17,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552598305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:17,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:17,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:23:17,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477978798] [2022-12-14 15:23:17,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:17,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:23:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:17,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:23:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:23:17,560 INFO L87 Difference]: Start difference. First operand 8181 states and 25987 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:17,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:17,847 INFO L93 Difference]: Finished difference Result 13893 states and 44343 transitions. [2022-12-14 15:23:17,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:23:17,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:23:17,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:17,924 INFO L225 Difference]: With dead ends: 13893 [2022-12-14 15:23:17,924 INFO L226 Difference]: Without dead ends: 13893 [2022-12-14 15:23:17,925 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-12-14 15:23:17,926 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 60 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:17,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 29 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:23:17,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13893 states. [2022-12-14 15:23:18,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13893 to 11989. [2022-12-14 15:23:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11989 states, 11414 states have (on average 3.5296127562642368) internal successors, (40287), 11988 states have internal predecessors, (40287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11989 states to 11989 states and 40287 transitions. [2022-12-14 15:23:18,405 INFO L78 Accepts]: Start accepts. Automaton has 11989 states and 40287 transitions. Word has length 6 [2022-12-14 15:23:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:18,406 INFO L495 AbstractCegarLoop]: Abstraction has 11989 states and 40287 transitions. [2022-12-14 15:23:18,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 11989 states and 40287 transitions. [2022-12-14 15:23:18,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:23:18,407 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:18,407 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:23:18,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:23:18,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting writer_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:18,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2127313123, now seen corresponding path program 1 times [2022-12-14 15:23:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:18,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199407583] [2022-12-14 15:23:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:18,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:18,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:18,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:18,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199407583] [2022-12-14 15:23:18,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199407583] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:18,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:18,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:23:18,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483206002] [2022-12-14 15:23:18,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:18,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:23:18,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:18,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:23:18,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:23:18,462 INFO L87 Difference]: Start difference. First operand 11989 states and 40287 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:18,778 INFO L93 Difference]: Finished difference Result 20413 states and 68853 transitions. [2022-12-14 15:23:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:23:18,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:23:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:18,890 INFO L225 Difference]: With dead ends: 20413 [2022-12-14 15:23:18,890 INFO L226 Difference]: Without dead ends: 20413 [2022-12-14 15:23:18,890 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-12-14 15:23:18,891 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 62 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:18,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 29 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:23:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20413 states. [2022-12-14 15:23:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20413 to 17605. [2022-12-14 15:23:19,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17605 states, 17030 states have (on average 3.6625366999412803) internal successors, (62373), 17604 states have internal predecessors, (62373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:19,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17605 states to 17605 states and 62373 transitions. [2022-12-14 15:23:19,442 INFO L78 Accepts]: Start accepts. Automaton has 17605 states and 62373 transitions. Word has length 6 [2022-12-14 15:23:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:19,442 INFO L495 AbstractCegarLoop]: Abstraction has 17605 states and 62373 transitions. [2022-12-14 15:23:19,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 17605 states and 62373 transitions. [2022-12-14 15:23:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:23:19,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:19,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:19,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:23:19,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:19,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1522136039, now seen corresponding path program 1 times [2022-12-14 15:23:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:19,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661825175] [2022-12-14 15:23:19,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:19,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:19,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:19,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:19,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661825175] [2022-12-14 15:23:19,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661825175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:19,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:19,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:23:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395064330] [2022-12-14 15:23:19,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:19,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:23:19,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:19,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:23:19,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:23:19,865 INFO L87 Difference]: Start difference. First operand 17605 states and 62373 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:20,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:20,264 INFO L93 Difference]: Finished difference Result 18201 states and 64155 transitions. [2022-12-14 15:23:20,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:23:20,264 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 15:23:20,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:20,323 INFO L225 Difference]: With dead ends: 18201 [2022-12-14 15:23:20,323 INFO L226 Difference]: Without dead ends: 18201 [2022-12-14 15:23:20,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:20,325 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 126 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:20,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 7 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:23:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18201 states. [2022-12-14 15:23:20,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18201 to 18009. [2022-12-14 15:23:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18009 states, 17434 states have (on average 3.646610072272571) internal successors, (63575), 18008 states have internal predecessors, (63575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18009 states to 18009 states and 63575 transitions. [2022-12-14 15:23:20,816 INFO L78 Accepts]: Start accepts. Automaton has 18009 states and 63575 transitions. Word has length 7 [2022-12-14 15:23:20,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:20,816 INFO L495 AbstractCegarLoop]: Abstraction has 18009 states and 63575 transitions. [2022-12-14 15:23:20,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 18009 states and 63575 transitions. [2022-12-14 15:23:20,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:23:20,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:20,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:20,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:23:20,818 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:20,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1522195715, now seen corresponding path program 1 times [2022-12-14 15:23:20,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:20,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209503692] [2022-12-14 15:23:20,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:21,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:21,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209503692] [2022-12-14 15:23:21,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209503692] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:21,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:21,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:23:21,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233330231] [2022-12-14 15:23:21,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:21,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:23:21,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:23:21,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:23:21,197 INFO L87 Difference]: Start difference. First operand 18009 states and 63575 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:21,652 INFO L93 Difference]: Finished difference Result 17985 states and 63459 transitions. [2022-12-14 15:23:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:23:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 15:23:21,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:21,721 INFO L225 Difference]: With dead ends: 17985 [2022-12-14 15:23:21,721 INFO L226 Difference]: Without dead ends: 17985 [2022-12-14 15:23:21,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:23:21,722 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:21,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 11 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:23:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17985 states. [2022-12-14 15:23:22,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17985 to 17945. [2022-12-14 15:23:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17945 states, 17370 states have (on average 3.6462291306850894) internal successors, (63335), 17944 states have internal predecessors, (63335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17945 states to 17945 states and 63335 transitions. [2022-12-14 15:23:22,276 INFO L78 Accepts]: Start accepts. Automaton has 17945 states and 63335 transitions. Word has length 7 [2022-12-14 15:23:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:22,277 INFO L495 AbstractCegarLoop]: Abstraction has 17945 states and 63335 transitions. [2022-12-14 15:23:22,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 17945 states and 63335 transitions. [2022-12-14 15:23:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:23:22,278 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:22,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:22,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:23:22,279 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:22,280 INFO L85 PathProgramCache]: Analyzing trace with hash 768922921, now seen corresponding path program 1 times [2022-12-14 15:23:22,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:22,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748478661] [2022-12-14 15:23:22,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:22,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:22,421 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:22,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748478661] [2022-12-14 15:23:22,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748478661] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:22,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:22,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836711069] [2022-12-14 15:23:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:22,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:22,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:22,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:22,423 INFO L87 Difference]: Start difference. First operand 17945 states and 63335 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:23,327 INFO L93 Difference]: Finished difference Result 39250 states and 130088 transitions. [2022-12-14 15:23:23,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 15:23:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:23,451 INFO L225 Difference]: With dead ends: 39250 [2022-12-14 15:23:23,451 INFO L226 Difference]: Without dead ends: 39250 [2022-12-14 15:23:23,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:23,452 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 581 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:23,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 72 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:23,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39250 states. [2022-12-14 15:23:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39250 to 21806. [2022-12-14 15:23:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21806 states, 21231 states have (on average 3.707032169940182) internal successors, (78704), 21805 states have internal predecessors, (78704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21806 states to 21806 states and 78704 transitions. [2022-12-14 15:23:24,061 INFO L78 Accepts]: Start accepts. Automaton has 21806 states and 78704 transitions. Word has length 11 [2022-12-14 15:23:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:24,061 INFO L495 AbstractCegarLoop]: Abstraction has 21806 states and 78704 transitions. [2022-12-14 15:23:24,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 21806 states and 78704 transitions. [2022-12-14 15:23:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:23:24,062 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:24,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:24,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:23:24,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:24,063 INFO L85 PathProgramCache]: Analyzing trace with hash 768923027, now seen corresponding path program 1 times [2022-12-14 15:23:24,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:24,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184690849] [2022-12-14 15:23:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:24,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:24,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:24,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184690849] [2022-12-14 15:23:24,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184690849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:24,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:24,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:24,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992259629] [2022-12-14 15:23:24,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:24,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:24,196 INFO L87 Difference]: Start difference. First operand 21806 states and 78704 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:25,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:25,157 INFO L93 Difference]: Finished difference Result 38526 states and 126402 transitions. [2022-12-14 15:23:25,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:25,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 15:23:25,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:25,274 INFO L225 Difference]: With dead ends: 38526 [2022-12-14 15:23:25,275 INFO L226 Difference]: Without dead ends: 38526 [2022-12-14 15:23:25,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:25,275 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 564 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:25,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 75 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38526 states. [2022-12-14 15:23:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38526 to 21752. [2022-12-14 15:23:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21752 states, 21177 states have (on average 3.6428200406100957) internal successors, (77144), 21751 states have internal predecessors, (77144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21752 states to 21752 states and 77144 transitions. [2022-12-14 15:23:25,892 INFO L78 Accepts]: Start accepts. Automaton has 21752 states and 77144 transitions. Word has length 11 [2022-12-14 15:23:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:25,893 INFO L495 AbstractCegarLoop]: Abstraction has 21752 states and 77144 transitions. [2022-12-14 15:23:25,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 21752 states and 77144 transitions. [2022-12-14 15:23:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:23:25,894 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:25,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:25,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:23:25,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting writer_fnErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:25,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:25,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1632413823, now seen corresponding path program 1 times [2022-12-14 15:23:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:25,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085233144] [2022-12-14 15:23:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:25,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:26,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:26,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085233144] [2022-12-14 15:23:26,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085233144] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:26,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:26,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:26,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070657610] [2022-12-14 15:23:26,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:26,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:26,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:26,035 INFO L87 Difference]: Start difference. First operand 21752 states and 77144 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:27,046 INFO L93 Difference]: Finished difference Result 46696 states and 155668 transitions. [2022-12-14 15:23:27,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:27,047 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 15:23:27,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:27,232 INFO L225 Difference]: With dead ends: 46696 [2022-12-14 15:23:27,233 INFO L226 Difference]: Without dead ends: 46696 [2022-12-14 15:23:27,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:27,234 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 592 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:27,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 72 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:27,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46696 states. [2022-12-14 15:23:28,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46696 to 26284. [2022-12-14 15:23:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26284 states, 25709 states have (on average 3.7017386907308722) internal successors, (95168), 26283 states have internal predecessors, (95168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26284 states to 26284 states and 95168 transitions. [2022-12-14 15:23:28,157 INFO L78 Accepts]: Start accepts. Automaton has 26284 states and 95168 transitions. Word has length 11 [2022-12-14 15:23:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:28,158 INFO L495 AbstractCegarLoop]: Abstraction has 26284 states and 95168 transitions. [2022-12-14 15:23:28,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 26284 states and 95168 transitions. [2022-12-14 15:23:28,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:23:28,159 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:28,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:23:28,159 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting writer_fnErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:28,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:28,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1632413770, now seen corresponding path program 1 times [2022-12-14 15:23:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:28,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532779176] [2022-12-14 15:23:28,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:28,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:28,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:28,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532779176] [2022-12-14 15:23:28,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532779176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:28,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:28,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:28,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484528087] [2022-12-14 15:23:28,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:28,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:28,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:28,330 INFO L87 Difference]: Start difference. First operand 26284 states and 95168 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:29,397 INFO L93 Difference]: Finished difference Result 46576 states and 153767 transitions. [2022-12-14 15:23:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:29,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 15:23:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:29,560 INFO L225 Difference]: With dead ends: 46576 [2022-12-14 15:23:29,560 INFO L226 Difference]: Without dead ends: 46576 [2022-12-14 15:23:29,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:29,561 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 567 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:29,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 74 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:23:29,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46576 states. [2022-12-14 15:23:30,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46576 to 26155. [2022-12-14 15:23:30,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26155 states, 25580 states have (on average 3.6360437842064113) internal successors, (93010), 26154 states have internal predecessors, (93010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26155 states to 26155 states and 93010 transitions. [2022-12-14 15:23:30,234 INFO L78 Accepts]: Start accepts. Automaton has 26155 states and 93010 transitions. Word has length 11 [2022-12-14 15:23:30,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:30,234 INFO L495 AbstractCegarLoop]: Abstraction has 26155 states and 93010 transitions. [2022-12-14 15:23:30,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26155 states and 93010 transitions. [2022-12-14 15:23:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:23:30,235 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:30,235 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:30,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:23:30,235 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:30,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2010479589, now seen corresponding path program 1 times [2022-12-14 15:23:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:30,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695693354] [2022-12-14 15:23:30,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:30,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-12-14 15:23:30,278 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:30,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695693354] [2022-12-14 15:23:30,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695693354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:30,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:30,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:23:30,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598411699] [2022-12-14 15:23:30,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:30,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:23:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:30,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:23:30,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:23:30,280 INFO L87 Difference]: Start difference. First operand 26155 states and 93010 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:30,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:30,424 INFO L93 Difference]: Finished difference Result 9283 states and 25447 transitions. [2022-12-14 15:23:30,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:23:30,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:23:30,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:30,462 INFO L225 Difference]: With dead ends: 9283 [2022-12-14 15:23:30,462 INFO L226 Difference]: Without dead ends: 9283 [2022-12-14 15:23:30,462 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-12-14 15:23:30,463 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:30,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 26 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:23:30,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9283 states. [2022-12-14 15:23:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9283 to 9095. [2022-12-14 15:23:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9095 states, 8655 states have (on average 2.8742923165800116) internal successors, (24877), 9094 states have internal predecessors, (24877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 24877 transitions. [2022-12-14 15:23:30,675 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 24877 transitions. Word has length 13 [2022-12-14 15:23:30,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:30,675 INFO L495 AbstractCegarLoop]: Abstraction has 9095 states and 24877 transitions. [2022-12-14 15:23:30,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 24877 transitions. [2022-12-14 15:23:30,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:23:30,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:30,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:30,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:23:30,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:30,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:30,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1923074061, now seen corresponding path program 1 times [2022-12-14 15:23:30,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:30,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702300536] [2022-12-14 15:23:30,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:30,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:30,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702300536] [2022-12-14 15:23:30,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702300536] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:30,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602501587] [2022-12-14 15:23:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:30,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:30,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:30,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:23:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:23:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:30,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:30,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:23:30,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602501587] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:30,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:23:30,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-14 15:23:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273615638] [2022-12-14 15:23:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:30,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:23:30,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:30,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:23:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:23:30,859 INFO L87 Difference]: Start difference. First operand 9095 states and 24877 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:31,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:31,063 INFO L93 Difference]: Finished difference Result 8646 states and 23165 transitions. [2022-12-14 15:23:31,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:23:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:23:31,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:31,084 INFO L225 Difference]: With dead ends: 8646 [2022-12-14 15:23:31,084 INFO L226 Difference]: Without dead ends: 8646 [2022-12-14 15:23:31,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:23:31,085 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 117 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 57 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.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:31,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 57 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:23:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2022-12-14 15:23:31,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8102. [2022-12-14 15:23:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8102 states, 7770 states have (on average 2.8824967824967827) internal successors, (22397), 8101 states have internal predecessors, (22397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:31,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8102 states to 8102 states and 22397 transitions. [2022-12-14 15:23:31,303 INFO L78 Accepts]: Start accepts. Automaton has 8102 states and 22397 transitions. Word has length 14 [2022-12-14 15:23:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:31,303 INFO L495 AbstractCegarLoop]: Abstraction has 8102 states and 22397 transitions. [2022-12-14 15:23:31,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8102 states and 22397 transitions. [2022-12-14 15:23:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-14 15:23:31,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:31,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:31,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:23:31,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:31,506 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting writer_fnErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:31,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:31,508 INFO L85 PathProgramCache]: Analyzing trace with hash -673598875, now seen corresponding path program 1 times [2022-12-14 15:23:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:31,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869231974] [2022-12-14 15:23:31,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:31,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869231974] [2022-12-14 15:23:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869231974] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:31,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228015377] [2022-12-14 15:23:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:31,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:31,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:31,584 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:31,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:23:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:31,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 15:23:31,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:31,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:31,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:23:31,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228015377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:31,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 15:23:31,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-14 15:23:31,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404293244] [2022-12-14 15:23:31,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:31,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:23:31,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:31,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:23:31,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:23:31,683 INFO L87 Difference]: Start difference. First operand 8102 states and 22397 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:31,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:31,871 INFO L93 Difference]: Finished difference Result 7645 states and 20783 transitions. [2022-12-14 15:23:31,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:23:31,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-12-14 15:23:31,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:31,885 INFO L225 Difference]: With dead ends: 7645 [2022-12-14 15:23:31,885 INFO L226 Difference]: Without dead ends: 7645 [2022-12-14 15:23:31,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:23:31,886 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 121 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:31,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 48 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:23:31,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7645 states. [2022-12-14 15:23:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7645 to 7189. [2022-12-14 15:23:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7189 states, 6938 states have (on average 2.8986739694436436) internal successors, (20111), 7188 states have internal predecessors, (20111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 20111 transitions. [2022-12-14 15:23:32,003 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 20111 transitions. Word has length 14 [2022-12-14 15:23:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:32,003 INFO L495 AbstractCegarLoop]: Abstraction has 7189 states and 20111 transitions. [2022-12-14 15:23:32,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 20111 transitions. [2022-12-14 15:23:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:23:32,004 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:32,004 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:32,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:23:32,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 15:23:32,205 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:32,206 INFO L85 PathProgramCache]: Analyzing trace with hash -514242765, now seen corresponding path program 1 times [2022-12-14 15:23:32,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:32,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990691902] [2022-12-14 15:23:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:32,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:32,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:32,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:32,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990691902] [2022-12-14 15:23:32,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990691902] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:32,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463824600] [2022-12-14 15:23:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:32,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:32,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:32,487 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:32,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:23:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:32,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:23:32,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:32,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:23:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:32,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:23:32,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 15:23:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:32,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463824600] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:23:32,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [353750967] [2022-12-14 15:23:32,815 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:23:32,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:23:32,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-12-14 15:23:32,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16558404] [2022-12-14 15:23:32,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:23:32,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:23:32,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:32,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:23:32,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:23:32,818 INFO L87 Difference]: Start difference. First operand 7189 states and 20111 transitions. Second operand has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:33,490 INFO L93 Difference]: Finished difference Result 9537 states and 26363 transitions. [2022-12-14 15:23:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 15:23:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:23:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:33,509 INFO L225 Difference]: With dead ends: 9537 [2022-12-14 15:23:33,509 INFO L226 Difference]: Without dead ends: 9537 [2022-12-14 15:23:33,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:23:33,510 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 465 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:33,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 89 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:23:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9537 states. [2022-12-14 15:23:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9537 to 7745. [2022-12-14 15:23:33,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7745 states, 7494 states have (on average 2.936749399519616) internal successors, (22008), 7744 states have internal predecessors, (22008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7745 states to 7745 states and 22008 transitions. [2022-12-14 15:23:33,659 INFO L78 Accepts]: Start accepts. Automaton has 7745 states and 22008 transitions. Word has length 15 [2022-12-14 15:23:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:33,659 INFO L495 AbstractCegarLoop]: Abstraction has 7745 states and 22008 transitions. [2022-12-14 15:23:33,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.090909090909091) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 7745 states and 22008 transitions. [2022-12-14 15:23:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:23:33,660 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:33,661 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:33,665 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:23:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 15:23:33,862 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -514242730, now seen corresponding path program 1 times [2022-12-14 15:23:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:33,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757772453] [2022-12-14 15:23:33,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:34,088 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757772453] [2022-12-14 15:23:34,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757772453] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:34,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601735489] [2022-12-14 15:23:34,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:34,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:34,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:34,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:23:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:34,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:23:34,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:34,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:23:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:34,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:23:34,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-14 15:23:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:34,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601735489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:23:34,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1475412791] [2022-12-14 15:23:34,329 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:23:34,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:23:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2022-12-14 15:23:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657503215] [2022-12-14 15:23:34,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:23:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:23:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:23:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:23:34,331 INFO L87 Difference]: Start difference. First operand 7745 states and 22008 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:34,781 INFO L93 Difference]: Finished difference Result 9321 states and 25699 transitions. [2022-12-14 15:23:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:23:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:23:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:34,799 INFO L225 Difference]: With dead ends: 9321 [2022-12-14 15:23:34,799 INFO L226 Difference]: Without dead ends: 9321 [2022-12-14 15:23:34,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:34,800 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 439 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:34,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 63 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:23:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9321 states. [2022-12-14 15:23:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9321 to 7729. [2022-12-14 15:23:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7729 states, 7478 states have (on average 2.92110189890345) internal successors, (21844), 7728 states have internal predecessors, (21844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:34,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7729 states to 7729 states and 21844 transitions. [2022-12-14 15:23:34,918 INFO L78 Accepts]: Start accepts. Automaton has 7729 states and 21844 transitions. Word has length 15 [2022-12-14 15:23:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:34,918 INFO L495 AbstractCegarLoop]: Abstraction has 7729 states and 21844 transitions. [2022-12-14 15:23:34,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7729 states and 21844 transitions. [2022-12-14 15:23:34,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:23:34,919 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:34,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:34,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:23:35,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 15:23:35,121 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash 593273013, now seen corresponding path program 1 times [2022-12-14 15:23:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:35,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608958795] [2022-12-14 15:23:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:35,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:35,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608958795] [2022-12-14 15:23:35,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608958795] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:35,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511924916] [2022-12-14 15:23:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:35,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:35,359 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:35,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:23:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:35,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:23:35,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:35,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:23:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:35,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:23:35,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 15:23:35,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:35,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511924916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:23:35,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1440580031] [2022-12-14 15:23:35,613 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:23:35,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:23:35,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-14 15:23:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592317662] [2022-12-14 15:23:35,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:23:35,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:23:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:23:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:35,615 INFO L87 Difference]: Start difference. First operand 7729 states and 21844 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:36,240 INFO L93 Difference]: Finished difference Result 9951 states and 27742 transitions. [2022-12-14 15:23:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:23:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:23:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:36,257 INFO L225 Difference]: With dead ends: 9951 [2022-12-14 15:23:36,258 INFO L226 Difference]: Without dead ends: 9951 [2022-12-14 15:23:36,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:23:36,258 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 507 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:36,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 110 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:36,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9951 states. [2022-12-14 15:23:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9951 to 8287. [2022-12-14 15:23:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8287 states, 8036 states have (on average 2.9525883524141365) internal successors, (23727), 8286 states have internal predecessors, (23727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:36,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8287 states to 8287 states and 23727 transitions. [2022-12-14 15:23:36,385 INFO L78 Accepts]: Start accepts. Automaton has 8287 states and 23727 transitions. Word has length 15 [2022-12-14 15:23:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:36,385 INFO L495 AbstractCegarLoop]: Abstraction has 8287 states and 23727 transitions. [2022-12-14 15:23:36,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:36,385 INFO L276 IsEmpty]: Start isEmpty. Operand 8287 states and 23727 transitions. [2022-12-14 15:23:36,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:23:36,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:36,386 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:36,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:23:36,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 15:23:36,587 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting writer_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:36,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 593273048, now seen corresponding path program 1 times [2022-12-14 15:23:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:36,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376672474] [2022-12-14 15:23:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:36,881 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:36,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376672474] [2022-12-14 15:23:36,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376672474] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:23:36,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271299905] [2022-12-14 15:23:36,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:36,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:23:36,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:23:36,883 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:23:36,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:23:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:36,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-14 15:23:36,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:23:37,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:23:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:37,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:23:37,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-14 15:23:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:37,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271299905] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:23:37,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1867978503] [2022-12-14 15:23:37,138 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:23:37,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:23:37,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-12-14 15:23:37,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360942735] [2022-12-14 15:23:37,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:23:37,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:23:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:37,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:23:37,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:37,139 INFO L87 Difference]: Start difference. First operand 8287 states and 23727 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:37,783 INFO L93 Difference]: Finished difference Result 9935 states and 27576 transitions. [2022-12-14 15:23:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 15:23:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:23:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:37,806 INFO L225 Difference]: With dead ends: 9935 [2022-12-14 15:23:37,806 INFO L226 Difference]: Without dead ends: 9935 [2022-12-14 15:23:37,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:23:37,807 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 499 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:37,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 111 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:37,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2022-12-14 15:23:37,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8271. [2022-12-14 15:23:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8271 states, 8020 states have (on average 2.937780548628429) internal successors, (23561), 8270 states have internal predecessors, (23561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8271 states to 8271 states and 23561 transitions. [2022-12-14 15:23:37,989 INFO L78 Accepts]: Start accepts. Automaton has 8271 states and 23561 transitions. Word has length 15 [2022-12-14 15:23:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:37,990 INFO L495 AbstractCegarLoop]: Abstraction has 8271 states and 23561 transitions. [2022-12-14 15:23:37,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:37,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8271 states and 23561 transitions. [2022-12-14 15:23:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:37,991 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:37,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:37,996 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:23:38,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 15:23:38,193 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:38,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 438477620, now seen corresponding path program 1 times [2022-12-14 15:23:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:38,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622659366] [2022-12-14 15:23:38,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:38,440 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:38,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622659366] [2022-12-14 15:23:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622659366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:38,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:38,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:23:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153805951] [2022-12-14 15:23:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:38,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:38,442 INFO L87 Difference]: Start difference. First operand 8271 states and 23561 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:38,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:38,748 INFO L93 Difference]: Finished difference Result 9754 states and 27347 transitions. [2022-12-14 15:23:38,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:38,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:38,771 INFO L225 Difference]: With dead ends: 9754 [2022-12-14 15:23:38,771 INFO L226 Difference]: Without dead ends: 9754 [2022-12-14 15:23:38,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:38,771 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 82 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:38,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 8 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:23:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9754 states. [2022-12-14 15:23:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9754 to 8270. [2022-12-14 15:23:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8270 states, 8019 states have (on average 2.937897493453049) internal successors, (23559), 8269 states have internal predecessors, (23559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8270 states to 8270 states and 23559 transitions. [2022-12-14 15:23:38,948 INFO L78 Accepts]: Start accepts. Automaton has 8270 states and 23559 transitions. Word has length 16 [2022-12-14 15:23:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:38,948 INFO L495 AbstractCegarLoop]: Abstraction has 8270 states and 23559 transitions. [2022-12-14 15:23:38,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:38,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8270 states and 23559 transitions. [2022-12-14 15:23:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:38,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:38,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:38,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 15:23:38,949 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:38,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:38,950 INFO L85 PathProgramCache]: Analyzing trace with hash 438477702, now seen corresponding path program 1 times [2022-12-14 15:23:38,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:38,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212670729] [2022-12-14 15:23:38,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:38,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:39,099 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:39,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212670729] [2022-12-14 15:23:39,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212670729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:39,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:39,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:23:39,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132172964] [2022-12-14 15:23:39,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:39,101 INFO L87 Difference]: Start difference. First operand 8270 states and 23559 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:39,489 INFO L93 Difference]: Finished difference Result 9486 states and 26618 transitions. [2022-12-14 15:23:39,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:39,508 INFO L225 Difference]: With dead ends: 9486 [2022-12-14 15:23:39,508 INFO L226 Difference]: Without dead ends: 9486 [2022-12-14 15:23:39,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:39,509 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 73 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:39,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 9 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:23:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9486 states. [2022-12-14 15:23:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9486 to 8269. [2022-12-14 15:23:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8269 states, 8018 states have (on average 2.9380144674482414) internal successors, (23557), 8268 states have internal predecessors, (23557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8269 states to 8269 states and 23557 transitions. [2022-12-14 15:23:39,674 INFO L78 Accepts]: Start accepts. Automaton has 8269 states and 23557 transitions. Word has length 16 [2022-12-14 15:23:39,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:39,675 INFO L495 AbstractCegarLoop]: Abstraction has 8269 states and 23557 transitions. [2022-12-14 15:23:39,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:39,675 INFO L276 IsEmpty]: Start isEmpty. Operand 8269 states and 23557 transitions. [2022-12-14 15:23:39,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:39,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:39,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:39,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-14 15:23:39,676 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:39,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1515703355, now seen corresponding path program 1 times [2022-12-14 15:23:39,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:39,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711508155] [2022-12-14 15:23:39,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:39,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:39,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:39,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711508155] [2022-12-14 15:23:39,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711508155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:39,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:39,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:39,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465146172] [2022-12-14 15:23:39,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:39,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:39,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:39,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:39,989 INFO L87 Difference]: Start difference. First operand 8269 states and 23557 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:41,010 INFO L93 Difference]: Finished difference Result 16330 states and 44203 transitions. [2022-12-14 15:23:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:23:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:41,045 INFO L225 Difference]: With dead ends: 16330 [2022-12-14 15:23:41,045 INFO L226 Difference]: Without dead ends: 16330 [2022-12-14 15:23:41,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:23:41,046 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 483 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:41,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 153 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:23:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16330 states. [2022-12-14 15:23:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16330 to 10387. [2022-12-14 15:23:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10387 states, 10136 states have (on average 3.0248618784530388) internal successors, (30660), 10386 states have internal predecessors, (30660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10387 states to 10387 states and 30660 transitions. [2022-12-14 15:23:41,245 INFO L78 Accepts]: Start accepts. Automaton has 10387 states and 30660 transitions. Word has length 16 [2022-12-14 15:23:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:41,245 INFO L495 AbstractCegarLoop]: Abstraction has 10387 states and 30660 transitions. [2022-12-14 15:23:41,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 10387 states and 30660 transitions. [2022-12-14 15:23:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:41,246 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:41,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:41,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-14 15:23:41,246 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting writer_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:41,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1515703390, now seen corresponding path program 1 times [2022-12-14 15:23:41,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:41,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778152453] [2022-12-14 15:23:41,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:41,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:41,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:41,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778152453] [2022-12-14 15:23:41,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778152453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:41,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:41,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:41,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779384970] [2022-12-14 15:23:41,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:41,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:41,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:41,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:41,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:41,410 INFO L87 Difference]: Start difference. First operand 10387 states and 30660 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:42,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:42,379 INFO L93 Difference]: Finished difference Result 16244 states and 43911 transitions. [2022-12-14 15:23:42,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:23:42,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:42,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:42,413 INFO L225 Difference]: With dead ends: 16244 [2022-12-14 15:23:42,413 INFO L226 Difference]: Without dead ends: 16244 [2022-12-14 15:23:42,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:23:42,414 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 402 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:42,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 153 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:23:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16244 states. [2022-12-14 15:23:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16244 to 10122. [2022-12-14 15:23:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10122 states, 9871 states have (on average 3.014385573903353) internal successors, (29755), 10121 states have internal predecessors, (29755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10122 states to 10122 states and 29755 transitions. [2022-12-14 15:23:42,633 INFO L78 Accepts]: Start accepts. Automaton has 10122 states and 29755 transitions. Word has length 16 [2022-12-14 15:23:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:42,633 INFO L495 AbstractCegarLoop]: Abstraction has 10122 states and 29755 transitions. [2022-12-14 15:23:42,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 10122 states and 29755 transitions. [2022-12-14 15:23:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:42,635 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:42,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:42,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-14 15:23:42,635 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1238287033, now seen corresponding path program 2 times [2022-12-14 15:23:42,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836126616] [2022-12-14 15:23:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:42,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:42,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:42,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836126616] [2022-12-14 15:23:42,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836126616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:42,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:42,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314986156] [2022-12-14 15:23:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:42,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:42,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:42,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:42,836 INFO L87 Difference]: Start difference. First operand 10122 states and 29755 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:43,735 INFO L93 Difference]: Finished difference Result 14085 states and 39733 transitions. [2022-12-14 15:23:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:23:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:43,764 INFO L225 Difference]: With dead ends: 14085 [2022-12-14 15:23:43,764 INFO L226 Difference]: Without dead ends: 14085 [2022-12-14 15:23:43,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:23:43,765 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 407 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:43,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 115 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14085 states. [2022-12-14 15:23:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14085 to 10355. [2022-12-14 15:23:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10355 states, 10104 states have (on average 3.010688836104513) internal successors, (30420), 10354 states have internal predecessors, (30420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10355 states to 10355 states and 30420 transitions. [2022-12-14 15:23:43,950 INFO L78 Accepts]: Start accepts. Automaton has 10355 states and 30420 transitions. Word has length 16 [2022-12-14 15:23:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:43,950 INFO L495 AbstractCegarLoop]: Abstraction has 10355 states and 30420 transitions. [2022-12-14 15:23:43,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:43,950 INFO L276 IsEmpty]: Start isEmpty. Operand 10355 states and 30420 transitions. [2022-12-14 15:23:43,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:43,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:43,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:43,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-14 15:23:43,952 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting writer_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:43,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:43,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1238287068, now seen corresponding path program 2 times [2022-12-14 15:23:43,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:43,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359285889] [2022-12-14 15:23:43,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:43,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:44,117 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359285889] [2022-12-14 15:23:44,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359285889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:44,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:44,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559668814] [2022-12-14 15:23:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:44,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:44,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:44,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:44,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:44,119 INFO L87 Difference]: Start difference. First operand 10355 states and 30420 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:44,732 INFO L93 Difference]: Finished difference Result 12791 states and 36476 transitions. [2022-12-14 15:23:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:44,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:44,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:44,757 INFO L225 Difference]: With dead ends: 12791 [2022-12-14 15:23:44,757 INFO L226 Difference]: Without dead ends: 12791 [2022-12-14 15:23:44,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:44,758 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 365 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:44,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 103 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12791 states. [2022-12-14 15:23:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12791 to 10064. [2022-12-14 15:23:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10064 states, 9813 states have (on average 3.0075410170182413) internal successors, (29513), 10063 states have internal predecessors, (29513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10064 states to 10064 states and 29513 transitions. [2022-12-14 15:23:44,923 INFO L78 Accepts]: Start accepts. Automaton has 10064 states and 29513 transitions. Word has length 16 [2022-12-14 15:23:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:44,923 INFO L495 AbstractCegarLoop]: Abstraction has 10064 states and 29513 transitions. [2022-12-14 15:23:44,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10064 states and 29513 transitions. [2022-12-14 15:23:44,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:44,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:44,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:44,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-14 15:23:44,925 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:44,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:44,925 INFO L85 PathProgramCache]: Analyzing trace with hash 742662825, now seen corresponding path program 1 times [2022-12-14 15:23:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:44,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361900200] [2022-12-14 15:23:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:44,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:45,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:45,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361900200] [2022-12-14 15:23:45,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361900200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:45,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:45,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:45,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375474473] [2022-12-14 15:23:45,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:45,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:45,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:45,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:45,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:45,140 INFO L87 Difference]: Start difference. First operand 10064 states and 29513 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:45,740 INFO L93 Difference]: Finished difference Result 18171 states and 51221 transitions. [2022-12-14 15:23:45,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:45,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:45,781 INFO L225 Difference]: With dead ends: 18171 [2022-12-14 15:23:45,781 INFO L226 Difference]: Without dead ends: 18171 [2022-12-14 15:23:45,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:45,781 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 388 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:45,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 142 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18171 states. [2022-12-14 15:23:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18171 to 13143. [2022-12-14 15:23:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13143 states, 12892 states have (on average 3.0679491157306855) internal successors, (39552), 13142 states have internal predecessors, (39552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13143 states to 13143 states and 39552 transitions. [2022-12-14 15:23:46,026 INFO L78 Accepts]: Start accepts. Automaton has 13143 states and 39552 transitions. Word has length 16 [2022-12-14 15:23:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:46,026 INFO L495 AbstractCegarLoop]: Abstraction has 13143 states and 39552 transitions. [2022-12-14 15:23:46,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13143 states and 39552 transitions. [2022-12-14 15:23:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:46,027 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:46,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:46,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-14 15:23:46,028 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:46,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:46,028 INFO L85 PathProgramCache]: Analyzing trace with hash 742662860, now seen corresponding path program 1 times [2022-12-14 15:23:46,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:46,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214598530] [2022-12-14 15:23:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:46,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:46,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:46,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214598530] [2022-12-14 15:23:46,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214598530] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:46,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:46,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:46,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670273667] [2022-12-14 15:23:46,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:46,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:46,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:46,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:46,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:46,257 INFO L87 Difference]: Start difference. First operand 13143 states and 39552 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:46,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:46,864 INFO L93 Difference]: Finished difference Result 18087 states and 50907 transitions. [2022-12-14 15:23:46,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:46,864 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:46,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:46,903 INFO L225 Difference]: With dead ends: 18087 [2022-12-14 15:23:46,903 INFO L226 Difference]: Without dead ends: 18087 [2022-12-14 15:23:46,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:46,904 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 420 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:46,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 142 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18087 states. [2022-12-14 15:23:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18087 to 12802. [2022-12-14 15:23:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12802 states, 12551 states have (on average 3.0514700023902477) internal successors, (38299), 12801 states have internal predecessors, (38299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12802 states to 12802 states and 38299 transitions. [2022-12-14 15:23:47,142 INFO L78 Accepts]: Start accepts. Automaton has 12802 states and 38299 transitions. Word has length 16 [2022-12-14 15:23:47,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:47,142 INFO L495 AbstractCegarLoop]: Abstraction has 12802 states and 38299 transitions. [2022-12-14 15:23:47,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:47,142 INFO L276 IsEmpty]: Start isEmpty. Operand 12802 states and 38299 transitions. [2022-12-14 15:23:47,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:47,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:47,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:47,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-14 15:23:47,143 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:47,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:47,144 INFO L85 PathProgramCache]: Analyzing trace with hash -623018579, now seen corresponding path program 3 times [2022-12-14 15:23:47,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:47,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650735776] [2022-12-14 15:23:47,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:47,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:47,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:47,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650735776] [2022-12-14 15:23:47,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650735776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:47,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:47,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:47,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505364666] [2022-12-14 15:23:47,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:47,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:47,346 INFO L87 Difference]: Start difference. First operand 12802 states and 38299 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:48,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:48,052 INFO L93 Difference]: Finished difference Result 21661 states and 60764 transitions. [2022-12-14 15:23:48,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:48,052 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:48,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:48,100 INFO L225 Difference]: With dead ends: 21661 [2022-12-14 15:23:48,100 INFO L226 Difference]: Without dead ends: 21661 [2022-12-14 15:23:48,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:48,101 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 388 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:48,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 143 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:23:48,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21661 states. [2022-12-14 15:23:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21661 to 13207. [2022-12-14 15:23:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13207 states, 12956 states have (on average 3.0536430997221364) internal successors, (39563), 13206 states have internal predecessors, (39563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13207 states to 13207 states and 39563 transitions. [2022-12-14 15:23:48,364 INFO L78 Accepts]: Start accepts. Automaton has 13207 states and 39563 transitions. Word has length 16 [2022-12-14 15:23:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:48,365 INFO L495 AbstractCegarLoop]: Abstraction has 13207 states and 39563 transitions. [2022-12-14 15:23:48,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 13207 states and 39563 transitions. [2022-12-14 15:23:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:48,366 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:48,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-14 15:23:48,366 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting writer_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:48,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -623018544, now seen corresponding path program 3 times [2022-12-14 15:23:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:48,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316138050] [2022-12-14 15:23:48,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:48,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:48,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:48,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316138050] [2022-12-14 15:23:48,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316138050] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:48,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:48,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074349029] [2022-12-14 15:23:48,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:48,562 INFO L87 Difference]: Start difference. First operand 13207 states and 39563 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:49,244 INFO L93 Difference]: Finished difference Result 21575 states and 60472 transitions. [2022-12-14 15:23:49,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:49,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:49,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:49,294 INFO L225 Difference]: With dead ends: 21575 [2022-12-14 15:23:49,294 INFO L226 Difference]: Without dead ends: 21575 [2022-12-14 15:23:49,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:49,295 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 418 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:49,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 143 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21575 states. [2022-12-14 15:23:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21575 to 11205. [2022-12-14 15:23:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11205 states, 10954 states have (on average 3.0) internal successors, (32862), 11204 states have internal predecessors, (32862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11205 states to 11205 states and 32862 transitions. [2022-12-14 15:23:49,529 INFO L78 Accepts]: Start accepts. Automaton has 11205 states and 32862 transitions. Word has length 16 [2022-12-14 15:23:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:49,529 INFO L495 AbstractCegarLoop]: Abstraction has 11205 states and 32862 transitions. [2022-12-14 15:23:49,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11205 states and 32862 transitions. [2022-12-14 15:23:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:49,530 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:49,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:49,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-14 15:23:49,530 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:49,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1106895165, now seen corresponding path program 2 times [2022-12-14 15:23:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:49,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411630423] [2022-12-14 15:23:49,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:49,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:49,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411630423] [2022-12-14 15:23:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411630423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:49,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:49,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:49,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179700700] [2022-12-14 15:23:49,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:49,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:49,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:49,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:49,768 INFO L87 Difference]: Start difference. First operand 11205 states and 32862 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:50,431 INFO L93 Difference]: Finished difference Result 17409 states and 49187 transitions. [2022-12-14 15:23:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:50,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:50,467 INFO L225 Difference]: With dead ends: 17409 [2022-12-14 15:23:50,468 INFO L226 Difference]: Without dead ends: 17409 [2022-12-14 15:23:50,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:50,468 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 394 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:50,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 142 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17409 states. [2022-12-14 15:23:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17409 to 13313. [2022-12-14 15:23:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13313 states, 13062 states have (on average 3.057648139641709) internal successors, (39939), 13312 states have internal predecessors, (39939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13313 states to 13313 states and 39939 transitions. [2022-12-14 15:23:50,699 INFO L78 Accepts]: Start accepts. Automaton has 13313 states and 39939 transitions. Word has length 16 [2022-12-14 15:23:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:50,699 INFO L495 AbstractCegarLoop]: Abstraction has 13313 states and 39939 transitions. [2022-12-14 15:23:50,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 13313 states and 39939 transitions. [2022-12-14 15:23:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:50,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:50,700 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:50,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-14 15:23:50,700 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1106895130, now seen corresponding path program 2 times [2022-12-14 15:23:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161666815] [2022-12-14 15:23:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:50,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:50,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:50,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161666815] [2022-12-14 15:23:50,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161666815] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:50,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:50,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:50,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004843088] [2022-12-14 15:23:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:50,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:23:50,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:50,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:23:50,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:23:50,893 INFO L87 Difference]: Start difference. First operand 13313 states and 39939 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:51,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:51,628 INFO L93 Difference]: Finished difference Result 19588 states and 54560 transitions. [2022-12-14 15:23:51,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:23:51,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:51,673 INFO L225 Difference]: With dead ends: 19588 [2022-12-14 15:23:51,673 INFO L226 Difference]: Without dead ends: 19588 [2022-12-14 15:23:51,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:23:51,674 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 390 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:51,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 155 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:23:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19588 states. [2022-12-14 15:23:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19588 to 12924. [2022-12-14 15:23:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12924 states, 12673 states have (on average 3.0545253688945) internal successors, (38710), 12923 states have internal predecessors, (38710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12924 states to 12924 states and 38710 transitions. [2022-12-14 15:23:51,997 INFO L78 Accepts]: Start accepts. Automaton has 12924 states and 38710 transitions. Word has length 16 [2022-12-14 15:23:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:51,998 INFO L495 AbstractCegarLoop]: Abstraction has 12924 states and 38710 transitions. [2022-12-14 15:23:51,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 12924 states and 38710 transitions. [2022-12-14 15:23:52,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:52,000 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:52,000 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:52,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-14 15:23:52,000 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1211571543, now seen corresponding path program 3 times [2022-12-14 15:23:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:52,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125014125] [2022-12-14 15:23:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:52,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:52,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:52,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125014125] [2022-12-14 15:23:52,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125014125] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:52,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:52,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929513848] [2022-12-14 15:23:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:52,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:52,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:52,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:52,247 INFO L87 Difference]: Start difference. First operand 12924 states and 38710 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:52,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:52,984 INFO L93 Difference]: Finished difference Result 16197 states and 47284 transitions. [2022-12-14 15:23:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:52,985 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:52,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:53,019 INFO L225 Difference]: With dead ends: 16197 [2022-12-14 15:23:53,019 INFO L226 Difference]: Without dead ends: 16197 [2022-12-14 15:23:53,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:53,020 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 415 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:53,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 75 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:23:53,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16197 states. [2022-12-14 15:23:53,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16197 to 13151. [2022-12-14 15:23:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13151 states, 12900 states have (on average 3.051240310077519) internal successors, (39361), 13150 states have internal predecessors, (39361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13151 states to 13151 states and 39361 transitions. [2022-12-14 15:23:53,248 INFO L78 Accepts]: Start accepts. Automaton has 13151 states and 39361 transitions. Word has length 16 [2022-12-14 15:23:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:53,249 INFO L495 AbstractCegarLoop]: Abstraction has 13151 states and 39361 transitions. [2022-12-14 15:23:53,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 13151 states and 39361 transitions. [2022-12-14 15:23:53,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:53,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:53,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:53,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-14 15:23:53,250 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:53,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1211571578, now seen corresponding path program 3 times [2022-12-14 15:23:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:53,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180865729] [2022-12-14 15:23:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:53,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-12-14 15:23:53,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:53,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180865729] [2022-12-14 15:23:53,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180865729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:53,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:53,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:53,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637393259] [2022-12-14 15:23:53,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:53,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:53,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:53,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:53,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:53,444 INFO L87 Difference]: Start difference. First operand 13151 states and 39361 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:54,098 INFO L93 Difference]: Finished difference Result 16113 states and 47082 transitions. [2022-12-14 15:23:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:23:54,099 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:54,130 INFO L225 Difference]: With dead ends: 16113 [2022-12-14 15:23:54,131 INFO L226 Difference]: Without dead ends: 16113 [2022-12-14 15:23:54,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:54,131 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 408 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:54,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 75 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:54,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16113 states. [2022-12-14 15:23:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16113 to 12864. [2022-12-14 15:23:54,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12864 states, 12613 states have (on average 3.049552049472766) internal successors, (38464), 12863 states have internal predecessors, (38464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12864 states to 12864 states and 38464 transitions. [2022-12-14 15:23:54,352 INFO L78 Accepts]: Start accepts. Automaton has 12864 states and 38464 transitions. Word has length 16 [2022-12-14 15:23:54,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:54,353 INFO L495 AbstractCegarLoop]: Abstraction has 12864 states and 38464 transitions. [2022-12-14 15:23:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 12864 states and 38464 transitions. [2022-12-14 15:23:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:54,354 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:54,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:54,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-14 15:23:54,354 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1587634277, now seen corresponding path program 4 times [2022-12-14 15:23:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:54,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295789173] [2022-12-14 15:23:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:54,551 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:54,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295789173] [2022-12-14 15:23:54,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295789173] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:54,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:54,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821305126] [2022-12-14 15:23:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:54,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:54,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:54,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:54,553 INFO L87 Difference]: Start difference. First operand 12864 states and 38464 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:55,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:55,163 INFO L93 Difference]: Finished difference Result 21281 states and 59587 transitions. [2022-12-14 15:23:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:55,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:55,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:55,211 INFO L225 Difference]: With dead ends: 21281 [2022-12-14 15:23:55,211 INFO L226 Difference]: Without dead ends: 21281 [2022-12-14 15:23:55,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:55,211 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 411 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:55,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 145 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:23:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21281 states. [2022-12-14 15:23:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21281 to 13139. [2022-12-14 15:23:55,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13139 states, 12888 states have (on average 3.054469273743017) internal successors, (39366), 13138 states have internal predecessors, (39366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13139 states to 13139 states and 39366 transitions. [2022-12-14 15:23:55,473 INFO L78 Accepts]: Start accepts. Automaton has 13139 states and 39366 transitions. Word has length 16 [2022-12-14 15:23:55,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:55,473 INFO L495 AbstractCegarLoop]: Abstraction has 13139 states and 39366 transitions. [2022-12-14 15:23:55,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 13139 states and 39366 transitions. [2022-12-14 15:23:55,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:55,475 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:55,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:55,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-14 15:23:55,475 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:55,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1587634312, now seen corresponding path program 4 times [2022-12-14 15:23:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:55,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969036848] [2022-12-14 15:23:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:55,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:55,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:55,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969036848] [2022-12-14 15:23:55,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969036848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:55,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:55,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:55,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087689131] [2022-12-14 15:23:55,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:55,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:55,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:55,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:55,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:55,661 INFO L87 Difference]: Start difference. First operand 13139 states and 39366 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:56,591 INFO L93 Difference]: Finished difference Result 23661 states and 65165 transitions. [2022-12-14 15:23:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:23:56,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:56,664 INFO L225 Difference]: With dead ends: 23661 [2022-12-14 15:23:56,664 INFO L226 Difference]: Without dead ends: 23661 [2022-12-14 15:23:56,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:23:56,664 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 438 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1653 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:56,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 158 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1653 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:56,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23661 states. [2022-12-14 15:23:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23661 to 11107. [2022-12-14 15:23:56,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11107 states, 10856 states have (on average 3.001750184229919) internal successors, (32587), 11106 states have internal predecessors, (32587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:56,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11107 states to 11107 states and 32587 transitions. [2022-12-14 15:23:56,897 INFO L78 Accepts]: Start accepts. Automaton has 11107 states and 32587 transitions. Word has length 16 [2022-12-14 15:23:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:56,897 INFO L495 AbstractCegarLoop]: Abstraction has 11107 states and 32587 transitions. [2022-12-14 15:23:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand 11107 states and 32587 transitions. [2022-12-14 15:23:56,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:56,898 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:56,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-12-14 15:23:56,898 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash 221952873, now seen corresponding path program 4 times [2022-12-14 15:23:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:56,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335453718] [2022-12-14 15:23:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:56,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:57,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:57,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335453718] [2022-12-14 15:23:57,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335453718] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:57,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:57,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:23:57,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269879345] [2022-12-14 15:23:57,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:57,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:23:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:23:57,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:23:57,273 INFO L87 Difference]: Start difference. First operand 11107 states and 32587 transitions. Second operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:58,248 INFO L93 Difference]: Finished difference Result 12229 states and 35394 transitions. [2022-12-14 15:23:58,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:23:58,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:58,271 INFO L225 Difference]: With dead ends: 12229 [2022-12-14 15:23:58,271 INFO L226 Difference]: Without dead ends: 12229 [2022-12-14 15:23:58,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:23:58,272 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 450 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:58,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 55 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:23:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12229 states. [2022-12-14 15:23:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12229 to 11320. [2022-12-14 15:23:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11320 states, 11069 states have (on average 2.9987352064323787) internal successors, (33193), 11319 states have internal predecessors, (33193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11320 states to 11320 states and 33193 transitions. [2022-12-14 15:23:58,441 INFO L78 Accepts]: Start accepts. Automaton has 11320 states and 33193 transitions. Word has length 16 [2022-12-14 15:23:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:58,442 INFO L495 AbstractCegarLoop]: Abstraction has 11320 states and 33193 transitions. [2022-12-14 15:23:58,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:58,442 INFO L276 IsEmpty]: Start isEmpty. Operand 11320 states and 33193 transitions. [2022-12-14 15:23:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 15:23:58,443 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:58,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:58,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-14 15:23:58,443 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting writer_fnErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash 221952908, now seen corresponding path program 4 times [2022-12-14 15:23:58,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676153984] [2022-12-14 15:23:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:58,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:58,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:58,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676153984] [2022-12-14 15:23:58,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676153984] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:58,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:58,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109241189] [2022-12-14 15:23:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:58,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:58,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:58,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:58,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:58,626 INFO L87 Difference]: Start difference. First operand 11320 states and 33193 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:59,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:23:59,306 INFO L93 Difference]: Finished difference Result 16485 states and 45336 transitions. [2022-12-14 15:23:59,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:23:59,306 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 15:23:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:23:59,341 INFO L225 Difference]: With dead ends: 16485 [2022-12-14 15:23:59,342 INFO L226 Difference]: Without dead ends: 16485 [2022-12-14 15:23:59,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:23:59,342 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 390 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:23:59,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 143 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:23:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16485 states. [2022-12-14 15:23:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16485 to 11568. [2022-12-14 15:23:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11568 states, 11317 states have (on average 3.0042414067332333) internal successors, (33999), 11567 states have internal predecessors, (33999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11568 states to 11568 states and 33999 transitions. [2022-12-14 15:23:59,549 INFO L78 Accepts]: Start accepts. Automaton has 11568 states and 33999 transitions. Word has length 16 [2022-12-14 15:23:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:23:59,550 INFO L495 AbstractCegarLoop]: Abstraction has 11568 states and 33999 transitions. [2022-12-14 15:23:59,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:23:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 11568 states and 33999 transitions. [2022-12-14 15:23:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:23:59,551 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:23:59,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:23:59,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-12-14 15:23:59,551 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:23:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:23:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash -281398789, now seen corresponding path program 1 times [2022-12-14 15:23:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:23:59,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504951780] [2022-12-14 15:23:59,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:23:59,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:23:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:23:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:23:59,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:23:59,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504951780] [2022-12-14 15:23:59,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504951780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:23:59,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:23:59,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:23:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056500690] [2022-12-14 15:23:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:23:59,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:23:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:23:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:23:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:23:59,703 INFO L87 Difference]: Start difference. First operand 11568 states and 33999 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:00,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:00,168 INFO L93 Difference]: Finished difference Result 13783 states and 39916 transitions. [2022-12-14 15:24:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:00,169 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:00,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:00,196 INFO L225 Difference]: With dead ends: 13783 [2022-12-14 15:24:00,197 INFO L226 Difference]: Without dead ends: 13783 [2022-12-14 15:24:00,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:00,197 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 204 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:00,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 7 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:24:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13783 states. [2022-12-14 15:24:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13783 to 11752. [2022-12-14 15:24:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11501 states have (on average 3.0081732023302323) internal successors, (34597), 11751 states have internal predecessors, (34597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 34597 transitions. [2022-12-14 15:24:00,384 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 34597 transitions. Word has length 17 [2022-12-14 15:24:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:00,385 INFO L495 AbstractCegarLoop]: Abstraction has 11752 states and 34597 transitions. [2022-12-14 15:24:00,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 34597 transitions. [2022-12-14 15:24:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:00,386 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:00,386 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:00,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-12-14 15:24:00,386 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:00,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:00,386 INFO L85 PathProgramCache]: Analyzing trace with hash -281398707, now seen corresponding path program 1 times [2022-12-14 15:24:00,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:00,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570484952] [2022-12-14 15:24:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:00,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:00,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:00,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570484952] [2022-12-14 15:24:00,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570484952] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:00,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:00,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:00,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12497694] [2022-12-14 15:24:00,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:00,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:00,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:00,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:00,548 INFO L87 Difference]: Start difference. First operand 11752 states and 34597 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:00,987 INFO L93 Difference]: Finished difference Result 13462 states and 38980 transitions. [2022-12-14 15:24:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:00,988 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:01,014 INFO L225 Difference]: With dead ends: 13462 [2022-12-14 15:24:01,014 INFO L226 Difference]: Without dead ends: 13462 [2022-12-14 15:24:01,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:01,015 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 189 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:01,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 7 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:24:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13462 states. [2022-12-14 15:24:01,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13462 to 11752. [2022-12-14 15:24:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11752 states, 11501 states have (on average 3.004521345969916) internal successors, (34555), 11751 states have internal predecessors, (34555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:01,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11752 states to 11752 states and 34555 transitions. [2022-12-14 15:24:01,199 INFO L78 Accepts]: Start accepts. Automaton has 11752 states and 34555 transitions. Word has length 17 [2022-12-14 15:24:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:01,199 INFO L495 AbstractCegarLoop]: Abstraction has 11752 states and 34555 transitions. [2022-12-14 15:24:01,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 11752 states and 34555 transitions. [2022-12-14 15:24:01,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:01,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:01,200 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-12-14 15:24:01,201 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:01,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 707976569, now seen corresponding path program 2 times [2022-12-14 15:24:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:01,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725396779] [2022-12-14 15:24:01,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:01,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:01,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:01,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725396779] [2022-12-14 15:24:01,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725396779] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:01,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:01,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386907672] [2022-12-14 15:24:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:01,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:01,391 INFO L87 Difference]: Start difference. First operand 11752 states and 34555 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:01,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:01,778 INFO L93 Difference]: Finished difference Result 12340 states and 35911 transitions. [2022-12-14 15:24:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:01,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:01,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:01,802 INFO L225 Difference]: With dead ends: 12340 [2022-12-14 15:24:01,802 INFO L226 Difference]: Without dead ends: 12340 [2022-12-14 15:24:01,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:01,803 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 169 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:01,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 7 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:24:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12340 states. [2022-12-14 15:24:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12340 to 11819. [2022-12-14 15:24:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11819 states, 11568 states have (on average 3.006569847856155) internal successors, (34780), 11818 states have internal predecessors, (34780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11819 states to 11819 states and 34780 transitions. [2022-12-14 15:24:01,979 INFO L78 Accepts]: Start accepts. Automaton has 11819 states and 34780 transitions. Word has length 17 [2022-12-14 15:24:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:01,979 INFO L495 AbstractCegarLoop]: Abstraction has 11819 states and 34780 transitions. [2022-12-14 15:24:01,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11819 states and 34780 transitions. [2022-12-14 15:24:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:01,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:01,980 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:01,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-12-14 15:24:01,981 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 707976651, now seen corresponding path program 2 times [2022-12-14 15:24:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:01,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48487885] [2022-12-14 15:24:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:01,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:02,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:02,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:02,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48487885] [2022-12-14 15:24:02,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48487885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:02,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:02,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:02,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53501259] [2022-12-14 15:24:02,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:02,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:02,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:02,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:02,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:02,138 INFO L87 Difference]: Start difference. First operand 11819 states and 34780 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:02,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:02,591 INFO L93 Difference]: Finished difference Result 12340 states and 35869 transitions. [2022-12-14 15:24:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:02,614 INFO L225 Difference]: With dead ends: 12340 [2022-12-14 15:24:02,615 INFO L226 Difference]: Without dead ends: 12340 [2022-12-14 15:24:02,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:02,615 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:02,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 8 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:24:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12340 states. [2022-12-14 15:24:02,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12340 to 11735. [2022-12-14 15:24:02,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11735 states, 11484 states have (on average 3.005224660397074) internal successors, (34512), 11734 states have internal predecessors, (34512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:02,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11735 states to 11735 states and 34512 transitions. [2022-12-14 15:24:02,792 INFO L78 Accepts]: Start accepts. Automaton has 11735 states and 34512 transitions. Word has length 17 [2022-12-14 15:24:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:02,792 INFO L495 AbstractCegarLoop]: Abstraction has 11735 states and 34512 transitions. [2022-12-14 15:24:02,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:02,792 INFO L276 IsEmpty]: Start isEmpty. Operand 11735 states and 34512 transitions. [2022-12-14 15:24:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:02,793 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:02,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:02,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-14 15:24:02,793 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:02,793 INFO L85 PathProgramCache]: Analyzing trace with hash 707907749, now seen corresponding path program 3 times [2022-12-14 15:24:02,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:02,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016646006] [2022-12-14 15:24:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:02,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:02,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:02,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016646006] [2022-12-14 15:24:02,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016646006] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:02,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:02,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:02,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849216954] [2022-12-14 15:24:02,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:02,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:02,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:02,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:02,947 INFO L87 Difference]: Start difference. First operand 11735 states and 34512 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:03,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:03,356 INFO L93 Difference]: Finished difference Result 12184 states and 35439 transitions. [2022-12-14 15:24:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:03,379 INFO L225 Difference]: With dead ends: 12184 [2022-12-14 15:24:03,379 INFO L226 Difference]: Without dead ends: 12184 [2022-12-14 15:24:03,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:03,380 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 180 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:03,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 6 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:24:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12184 states. [2022-12-14 15:24:03,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12184 to 11750. [2022-12-14 15:24:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11750 states, 11499 states have (on average 3.00669623445517) internal successors, (34574), 11749 states have internal predecessors, (34574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11750 states to 11750 states and 34574 transitions. [2022-12-14 15:24:03,555 INFO L78 Accepts]: Start accepts. Automaton has 11750 states and 34574 transitions. Word has length 17 [2022-12-14 15:24:03,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:03,555 INFO L495 AbstractCegarLoop]: Abstraction has 11750 states and 34574 transitions. [2022-12-14 15:24:03,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11750 states and 34574 transitions. [2022-12-14 15:24:03,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 15:24:03,556 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:03,556 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:03,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-12-14 15:24:03,556 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:03,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:03,557 INFO L85 PathProgramCache]: Analyzing trace with hash 707907831, now seen corresponding path program 3 times [2022-12-14 15:24:03,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:03,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555162418] [2022-12-14 15:24:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:03,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:03,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:03,720 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:03,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555162418] [2022-12-14 15:24:03,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555162418] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:03,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:03,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 15:24:03,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381762916] [2022-12-14 15:24:03,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:03,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 15:24:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:03,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 15:24:03,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:03,721 INFO L87 Difference]: Start difference. First operand 11750 states and 34574 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:04,152 INFO L93 Difference]: Finished difference Result 12152 states and 35346 transitions. [2022-12-14 15:24:04,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 15:24:04,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 15:24:04,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:04,175 INFO L225 Difference]: With dead ends: 12152 [2022-12-14 15:24:04,175 INFO L226 Difference]: Without dead ends: 12152 [2022-12-14 15:24:04,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:04,175 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:04,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 8 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:24:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12152 states. [2022-12-14 15:24:04,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12152 to 11698. [2022-12-14 15:24:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11698 states, 11447 states have (on average 3.0054162662706387) internal successors, (34403), 11697 states have internal predecessors, (34403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11698 states to 11698 states and 34403 transitions. [2022-12-14 15:24:04,347 INFO L78 Accepts]: Start accepts. Automaton has 11698 states and 34403 transitions. Word has length 17 [2022-12-14 15:24:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:04,347 INFO L495 AbstractCegarLoop]: Abstraction has 11698 states and 34403 transitions. [2022-12-14 15:24:04,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11698 states and 34403 transitions. [2022-12-14 15:24:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 15:24:04,348 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:04,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:04,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-12-14 15:24:04,349 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:04,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash 470230286, now seen corresponding path program 1 times [2022-12-14 15:24:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:04,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917556729] [2022-12-14 15:24:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:04,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:04,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917556729] [2022-12-14 15:24:04,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917556729] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:04,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:04,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 15:24:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308201497] [2022-12-14 15:24:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:04,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:24:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:24:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:24:04,508 INFO L87 Difference]: Start difference. First operand 11698 states and 34403 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:04,738 INFO L93 Difference]: Finished difference Result 11674 states and 34352 transitions. [2022-12-14 15:24:04,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:24:04,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-14 15:24:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:04,762 INFO L225 Difference]: With dead ends: 11674 [2022-12-14 15:24:04,762 INFO L226 Difference]: Without dead ends: 11674 [2022-12-14 15:24:04,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 15:24:04,762 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:04,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:04,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11674 states. [2022-12-14 15:24:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11674 to 11674. [2022-12-14 15:24:04,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11674 states, 11423 states have (on average 3.00726604219557) internal successors, (34352), 11673 states have internal predecessors, (34352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11674 states to 11674 states and 34352 transitions. [2022-12-14 15:24:04,941 INFO L78 Accepts]: Start accepts. Automaton has 11674 states and 34352 transitions. Word has length 18 [2022-12-14 15:24:04,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:04,941 INFO L495 AbstractCegarLoop]: Abstraction has 11674 states and 34352 transitions. [2022-12-14 15:24:04,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 11674 states and 34352 transitions. [2022-12-14 15:24:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:24:04,943 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:04,943 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-12-14 15:24:04,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-12-14 15:24:04,943 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:04,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:04,943 INFO L85 PathProgramCache]: Analyzing trace with hash 158735893, now seen corresponding path program 1 times [2022-12-14 15:24:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:04,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292539452] [2022-12-14 15:24:04,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:05,153 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:05,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292539452] [2022-12-14 15:24:05,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292539452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:05,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:05,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:24:05,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871242081] [2022-12-14 15:24:05,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:05,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:24:05,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:24:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:24:05,154 INFO L87 Difference]: Start difference. First operand 11674 states and 34352 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:05,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:05,422 INFO L93 Difference]: Finished difference Result 11761 states and 34568 transitions. [2022-12-14 15:24:05,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:24:05,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:24:05,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:05,445 INFO L225 Difference]: With dead ends: 11761 [2022-12-14 15:24:05,445 INFO L226 Difference]: Without dead ends: 11761 [2022-12-14 15:24:05,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:24:05,445 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:05,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 5 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11761 states. [2022-12-14 15:24:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11761 to 11584. [2022-12-14 15:24:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11584 states, 11333 states have (on average 3.007059031147975) internal successors, (34079), 11583 states have internal predecessors, (34079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11584 states to 11584 states and 34079 transitions. [2022-12-14 15:24:05,654 INFO L78 Accepts]: Start accepts. Automaton has 11584 states and 34079 transitions. Word has length 19 [2022-12-14 15:24:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:05,654 INFO L495 AbstractCegarLoop]: Abstraction has 11584 states and 34079 transitions. [2022-12-14 15:24:05,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11584 states and 34079 transitions. [2022-12-14 15:24:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:24:05,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:05,655 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-12-14 15:24:05,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-12-14 15:24:05,656 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:05,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1673626313, now seen corresponding path program 2 times [2022-12-14 15:24:05,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:05,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648948128] [2022-12-14 15:24:05,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:05,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:05,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:05,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648948128] [2022-12-14 15:24:05,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648948128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:05,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:05,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-14 15:24:05,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486163945] [2022-12-14 15:24:05,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:05,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 15:24:05,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:05,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 15:24:05,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:24:05,873 INFO L87 Difference]: Start difference. First operand 11584 states and 34079 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:06,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:06,165 INFO L93 Difference]: Finished difference Result 10281 states and 30175 transitions. [2022-12-14 15:24:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:24:06,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:24:06,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:06,184 INFO L225 Difference]: With dead ends: 10281 [2022-12-14 15:24:06,184 INFO L226 Difference]: Without dead ends: 10281 [2022-12-14 15:24:06,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-14 15:24:06,185 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 80 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:06,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 6 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:24:06,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10281 states. [2022-12-14 15:24:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10281 to 10239. [2022-12-14 15:24:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10239 states, 9988 states have (on average 3.0098117741289547) internal successors, (30062), 10238 states have internal predecessors, (30062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10239 states to 10239 states and 30062 transitions. [2022-12-14 15:24:06,331 INFO L78 Accepts]: Start accepts. Automaton has 10239 states and 30062 transitions. Word has length 19 [2022-12-14 15:24:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:06,331 INFO L495 AbstractCegarLoop]: Abstraction has 10239 states and 30062 transitions. [2022-12-14 15:24:06,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10239 states and 30062 transitions. [2022-12-14 15:24:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:24:06,332 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:06,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:06,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-12-14 15:24:06,333 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1765864259, now seen corresponding path program 1 times [2022-12-14 15:24:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:06,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704484516] [2022-12-14 15:24:06,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:06,438 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:06,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704484516] [2022-12-14 15:24:06,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704484516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:06,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334817873] [2022-12-14 15:24:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:06,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:06,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:06,440 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:06,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:24:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:06,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 15:24:06,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:06,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:24:06,695 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:24:06,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 48 [2022-12-14 15:24:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:06,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:24:06,861 INFO L321 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-12-14 15:24:06,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2022-12-14 15:24:06,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:24:06,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 116 [2022-12-14 15:24:06,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-12-14 15:24:06,928 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:24:06,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 89 [2022-12-14 15:24:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:07,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334817873] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:07,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915936632] [2022-12-14 15:24:07,011 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:24:07,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:24:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 15 [2022-12-14 15:24:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667300859] [2022-12-14 15:24:07,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:24:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:07,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:24:07,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:24:07,013 INFO L87 Difference]: Start difference. First operand 10239 states and 30062 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:08,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:08,891 INFO L93 Difference]: Finished difference Result 18177 states and 52372 transitions. [2022-12-14 15:24:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:24:08,892 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:24:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:08,933 INFO L225 Difference]: With dead ends: 18177 [2022-12-14 15:24:08,933 INFO L226 Difference]: Without dead ends: 18177 [2022-12-14 15:24:08,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:24:08,934 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 956 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 3276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:08,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 174 Invalid, 3276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:24:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18177 states. [2022-12-14 15:24:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18177 to 11922. [2022-12-14 15:24:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11922 states, 11671 states have (on average 3.016879444777654) internal successors, (35210), 11921 states have internal predecessors, (35210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11922 states to 11922 states and 35210 transitions. [2022-12-14 15:24:09,167 INFO L78 Accepts]: Start accepts. Automaton has 11922 states and 35210 transitions. Word has length 19 [2022-12-14 15:24:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:09,167 INFO L495 AbstractCegarLoop]: Abstraction has 11922 states and 35210 transitions. [2022-12-14 15:24:09,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 11922 states and 35210 transitions. [2022-12-14 15:24:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:24:09,169 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:09,169 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:09,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:24:09,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-12-14 15:24:09,370 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting writer_fnErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:09,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:09,371 INFO L85 PathProgramCache]: Analyzing trace with hash -411137481, now seen corresponding path program 1 times [2022-12-14 15:24:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:09,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507554526] [2022-12-14 15:24:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:09,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:09,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507554526] [2022-12-14 15:24:09,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507554526] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:09,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501693693] [2022-12-14 15:24:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:09,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:09,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:09,486 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:09,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:24:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:09,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-14 15:24:09,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:09,646 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:24:09,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 31 [2022-12-14 15:24:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:09,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:24:09,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-12-14 15:24:09,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-12-14 15:24:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:09,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501693693] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:09,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [827219214] [2022-12-14 15:24:09,747 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:24:09,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:24:09,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2022-12-14 15:24:09,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799625855] [2022-12-14 15:24:09,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:09,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:24:09,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:09,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:24:09,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:24:09,748 INFO L87 Difference]: Start difference. First operand 11922 states and 35210 transitions. Second operand has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:11,884 INFO L93 Difference]: Finished difference Result 25765 states and 74096 transitions. [2022-12-14 15:24:11,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 15:24:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:24:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:11,946 INFO L225 Difference]: With dead ends: 25765 [2022-12-14 15:24:11,946 INFO L226 Difference]: Without dead ends: 25765 [2022-12-14 15:24:11,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=467, Invalid=1093, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 15:24:11,947 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1716 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1716 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:11,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1716 Valid, 132 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 15:24:11,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25765 states. [2022-12-14 15:24:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25765 to 13520. [2022-12-14 15:24:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13520 states, 13323 states have (on average 2.983562260752083) internal successors, (39750), 13519 states have internal predecessors, (39750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13520 states to 13520 states and 39750 transitions. [2022-12-14 15:24:12,274 INFO L78 Accepts]: Start accepts. Automaton has 13520 states and 39750 transitions. Word has length 19 [2022-12-14 15:24:12,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:12,274 INFO L495 AbstractCegarLoop]: Abstraction has 13520 states and 39750 transitions. [2022-12-14 15:24:12,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.764705882352941) internal successors, (47), 18 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 13520 states and 39750 transitions. [2022-12-14 15:24:12,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 15:24:12,276 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:12,276 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:12,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:24:12,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:12,478 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting writer_fnErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -411137534, now seen corresponding path program 1 times [2022-12-14 15:24:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:12,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212346692] [2022-12-14 15:24:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:12,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:12,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212346692] [2022-12-14 15:24:12,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212346692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:12,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989013594] [2022-12-14 15:24:12,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:12,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:12,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:12,620 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:12,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:24:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:12,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-14 15:24:12,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:12,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:24:12,862 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:24:12,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 48 [2022-12-14 15:24:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:12,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:24:13,008 INFO L321 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-12-14 15:24:13,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 66 [2022-12-14 15:24:13,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:24:13,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 116 [2022-12-14 15:24:13,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2022-12-14 15:24:13,066 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:24:13,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 89 [2022-12-14 15:24:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:13,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989013594] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:13,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [817905945] [2022-12-14 15:24:13,125 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:24:13,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:24:13,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 15 [2022-12-14 15:24:13,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253767755] [2022-12-14 15:24:13,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:13,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:24:13,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:13,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:24:13,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:24:13,126 INFO L87 Difference]: Start difference. First operand 13520 states and 39750 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:15,228 INFO L93 Difference]: Finished difference Result 17148 states and 48047 transitions. [2022-12-14 15:24:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:24:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-14 15:24:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:15,284 INFO L225 Difference]: With dead ends: 17148 [2022-12-14 15:24:15,284 INFO L226 Difference]: Without dead ends: 17049 [2022-12-14 15:24:15,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:24:15,285 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 981 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:15,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 162 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2932 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-12-14 15:24:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17049 states. [2022-12-14 15:24:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17049 to 13571. [2022-12-14 15:24:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13571 states, 13374 states have (on average 2.9735307312696277) internal successors, (39768), 13570 states have internal predecessors, (39768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13571 states to 13571 states and 39768 transitions. [2022-12-14 15:24:15,612 INFO L78 Accepts]: Start accepts. Automaton has 13571 states and 39768 transitions. Word has length 19 [2022-12-14 15:24:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:15,612 INFO L495 AbstractCegarLoop]: Abstraction has 13571 states and 39768 transitions. [2022-12-14 15:24:15,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 13571 states and 39768 transitions. [2022-12-14 15:24:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 15:24:15,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:15,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:15,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 15:24:15,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-12-14 15:24:15,816 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:15,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:15,817 INFO L85 PathProgramCache]: Analyzing trace with hash 483500738, now seen corresponding path program 1 times [2022-12-14 15:24:15,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:15,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084434968] [2022-12-14 15:24:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:24:15,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084434968] [2022-12-14 15:24:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084434968] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:15,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485789889] [2022-12-14 15:24:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:15,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:15,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:15,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:15,879 INFO L87 Difference]: Start difference. First operand 13571 states and 39768 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:15,979 INFO L93 Difference]: Finished difference Result 12315 states and 36331 transitions. [2022-12-14 15:24:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 15:24:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:16,010 INFO L225 Difference]: With dead ends: 12315 [2022-12-14 15:24:16,010 INFO L226 Difference]: Without dead ends: 12298 [2022-12-14 15:24:16,010 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-12-14 15:24:16,010 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 50 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:16,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 28 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12298 states. [2022-12-14 15:24:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12298 to 10744. [2022-12-14 15:24:16,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10744 states, 10592 states have (on average 3.0396525679758306) internal successors, (32196), 10743 states have internal predecessors, (32196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10744 states to 10744 states and 32196 transitions. [2022-12-14 15:24:16,197 INFO L78 Accepts]: Start accepts. Automaton has 10744 states and 32196 transitions. Word has length 21 [2022-12-14 15:24:16,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:16,198 INFO L495 AbstractCegarLoop]: Abstraction has 10744 states and 32196 transitions. [2022-12-14 15:24:16,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:16,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10744 states and 32196 transitions. [2022-12-14 15:24:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:16,200 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:16,201 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-12-14 15:24:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-12-14 15:24:16,201 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:16,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:16,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1493544628, now seen corresponding path program 1 times [2022-12-14 15:24:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:16,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934963768] [2022-12-14 15:24:16,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:16,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:16,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934963768] [2022-12-14 15:24:16,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934963768] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:16,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:16,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:16,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442248086] [2022-12-14 15:24:16,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:16,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:16,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:16,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:16,523 INFO L87 Difference]: Start difference. First operand 10744 states and 32196 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:17,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:17,195 INFO L93 Difference]: Finished difference Result 12345 states and 36472 transitions. [2022-12-14 15:24:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:24:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:17,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:17,221 INFO L225 Difference]: With dead ends: 12345 [2022-12-14 15:24:17,221 INFO L226 Difference]: Without dead ends: 12345 [2022-12-14 15:24:17,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:24:17,222 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 143 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:17,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 10 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12345 states. [2022-12-14 15:24:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12345 to 10890. [2022-12-14 15:24:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 10738 states have (on average 3.0419072452970757) internal successors, (32664), 10889 states have internal predecessors, (32664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 32664 transitions. [2022-12-14 15:24:17,400 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 32664 transitions. Word has length 24 [2022-12-14 15:24:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:17,400 INFO L495 AbstractCegarLoop]: Abstraction has 10890 states and 32664 transitions. [2022-12-14 15:24:17,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:17,400 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 32664 transitions. [2022-12-14 15:24:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:17,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:17,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] [2022-12-14 15:24:17,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-12-14 15:24:17,402 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1493544546, now seen corresponding path program 1 times [2022-12-14 15:24:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:17,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625530036] [2022-12-14 15:24:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:17,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:17,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625530036] [2022-12-14 15:24:17,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625530036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:17,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:17,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:17,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662313514] [2022-12-14 15:24:17,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:17,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:17,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:17,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:17,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:17,693 INFO L87 Difference]: Start difference. First operand 10890 states and 32664 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:18,299 INFO L93 Difference]: Finished difference Result 12132 states and 35827 transitions. [2022-12-14 15:24:18,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:24:18,300 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:18,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:18,323 INFO L225 Difference]: With dead ends: 12132 [2022-12-14 15:24:18,323 INFO L226 Difference]: Without dead ends: 12132 [2022-12-14 15:24:18,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:24:18,323 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:18,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 8 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:24:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2022-12-14 15:24:18,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 10890. [2022-12-14 15:24:18,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10890 states, 10738 states have (on average 3.0375302663438255) internal successors, (32617), 10889 states have internal predecessors, (32617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10890 states to 10890 states and 32617 transitions. [2022-12-14 15:24:18,491 INFO L78 Accepts]: Start accepts. Automaton has 10890 states and 32617 transitions. Word has length 24 [2022-12-14 15:24:18,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:18,492 INFO L495 AbstractCegarLoop]: Abstraction has 10890 states and 32617 transitions. [2022-12-14 15:24:18,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 10890 states and 32617 transitions. [2022-12-14 15:24:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:18,494 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:18,494 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-12-14 15:24:18,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-12-14 15:24:18,494 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:18,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:18,494 INFO L85 PathProgramCache]: Analyzing trace with hash 202427621, now seen corresponding path program 1 times [2022-12-14 15:24:18,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:18,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397171746] [2022-12-14 15:24:18,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:18,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:18,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:18,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397171746] [2022-12-14 15:24:18,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397171746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:18,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:18,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:18,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283635788] [2022-12-14 15:24:18,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:18,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:18,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:18,838 INFO L87 Difference]: Start difference. First operand 10890 states and 32617 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:19,531 INFO L93 Difference]: Finished difference Result 12483 states and 36845 transitions. [2022-12-14 15:24:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:19,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:19,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:19,556 INFO L225 Difference]: With dead ends: 12483 [2022-12-14 15:24:19,556 INFO L226 Difference]: Without dead ends: 12483 [2022-12-14 15:24:19,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:19,556 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 190 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:19,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 10 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12483 states. [2022-12-14 15:24:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12483 to 11014. [2022-12-14 15:24:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11014 states, 10862 states have (on average 3.0375621432517033) internal successors, (32994), 11013 states have internal predecessors, (32994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 32994 transitions. [2022-12-14 15:24:19,761 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 32994 transitions. Word has length 24 [2022-12-14 15:24:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:19,762 INFO L495 AbstractCegarLoop]: Abstraction has 11014 states and 32994 transitions. [2022-12-14 15:24:19,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 32994 transitions. [2022-12-14 15:24:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:19,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:19,763 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-12-14 15:24:19,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-12-14 15:24:19,763 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:19,764 INFO L85 PathProgramCache]: Analyzing trace with hash 202427703, now seen corresponding path program 1 times [2022-12-14 15:24:19,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:19,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323634479] [2022-12-14 15:24:19,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:19,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:20,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:20,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:20,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323634479] [2022-12-14 15:24:20,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323634479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:20,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:20,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443339412] [2022-12-14 15:24:20,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:20,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:20,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:20,109 INFO L87 Difference]: Start difference. First operand 11014 states and 32994 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:20,816 INFO L93 Difference]: Finished difference Result 12259 states and 36171 transitions. [2022-12-14 15:24:20,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:20,816 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:20,842 INFO L225 Difference]: With dead ends: 12259 [2022-12-14 15:24:20,842 INFO L226 Difference]: Without dead ends: 12259 [2022-12-14 15:24:20,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:20,842 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 179 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:20,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 10 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12259 states. [2022-12-14 15:24:21,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12259 to 11014. [2022-12-14 15:24:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11014 states, 10862 states have (on average 3.0342478364942) internal successors, (32958), 11013 states have internal predecessors, (32958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11014 states to 11014 states and 32958 transitions. [2022-12-14 15:24:21,063 INFO L78 Accepts]: Start accepts. Automaton has 11014 states and 32958 transitions. Word has length 24 [2022-12-14 15:24:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:21,063 INFO L495 AbstractCegarLoop]: Abstraction has 11014 states and 32958 transitions. [2022-12-14 15:24:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:21,063 INFO L276 IsEmpty]: Start isEmpty. Operand 11014 states and 32958 transitions. [2022-12-14 15:24:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:21,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:21,066 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-12-14 15:24:21,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-12-14 15:24:21,067 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:21,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:21,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1760677670, now seen corresponding path program 2 times [2022-12-14 15:24:21,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:21,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700674990] [2022-12-14 15:24:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:21,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:21,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700674990] [2022-12-14 15:24:21,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700674990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:21,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:21,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401215348] [2022-12-14 15:24:21,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:21,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:21,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:21,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:21,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:21,532 INFO L87 Difference]: Start difference. First operand 11014 states and 32958 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:22,078 INFO L93 Difference]: Finished difference Result 13015 states and 38309 transitions. [2022-12-14 15:24:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:24:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:22,107 INFO L225 Difference]: With dead ends: 13015 [2022-12-14 15:24:22,107 INFO L226 Difference]: Without dead ends: 13015 [2022-12-14 15:24:22,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:24:22,107 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 177 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:22,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 13 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:24:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2022-12-14 15:24:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 11183. [2022-12-14 15:24:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11183 states, 11031 states have (on average 3.0365334058562232) internal successors, (33496), 11182 states have internal predecessors, (33496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:22,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11183 states to 11183 states and 33496 transitions. [2022-12-14 15:24:22,329 INFO L78 Accepts]: Start accepts. Automaton has 11183 states and 33496 transitions. Word has length 24 [2022-12-14 15:24:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:22,329 INFO L495 AbstractCegarLoop]: Abstraction has 11183 states and 33496 transitions. [2022-12-14 15:24:22,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:22,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11183 states and 33496 transitions. [2022-12-14 15:24:22,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:22,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:22,333 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-12-14 15:24:22,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-12-14 15:24:22,333 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1760677752, now seen corresponding path program 2 times [2022-12-14 15:24:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:22,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517629905] [2022-12-14 15:24:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:22,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:22,804 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:22,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517629905] [2022-12-14 15:24:22,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517629905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:22,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:22,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:22,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10043768] [2022-12-14 15:24:22,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:22,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:22,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:22,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:22,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:22,806 INFO L87 Difference]: Start difference. First operand 11183 states and 33496 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:23,380 INFO L93 Difference]: Finished difference Result 12802 states and 37664 transitions. [2022-12-14 15:24:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:24:23,381 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:23,405 INFO L225 Difference]: With dead ends: 12802 [2022-12-14 15:24:23,406 INFO L226 Difference]: Without dead ends: 12802 [2022-12-14 15:24:23,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:24:23,406 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 196 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:23,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 13 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:24:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2022-12-14 15:24:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 11041. [2022-12-14 15:24:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11041 states, 10889 states have (on average 3.034438424097713) internal successors, (33042), 11040 states have internal predecessors, (33042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:23,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11041 states to 11041 states and 33042 transitions. [2022-12-14 15:24:23,578 INFO L78 Accepts]: Start accepts. Automaton has 11041 states and 33042 transitions. Word has length 24 [2022-12-14 15:24:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:23,579 INFO L495 AbstractCegarLoop]: Abstraction has 11041 states and 33042 transitions. [2022-12-14 15:24:23,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:23,579 INFO L276 IsEmpty]: Start isEmpty. Operand 11041 states and 33042 transitions. [2022-12-14 15:24:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:23,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:23,581 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-12-14 15:24:23,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-12-14 15:24:23,581 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:23,581 INFO L85 PathProgramCache]: Analyzing trace with hash 705704792, now seen corresponding path program 3 times [2022-12-14 15:24:23,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:23,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274186450] [2022-12-14 15:24:23,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:23,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:23,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274186450] [2022-12-14 15:24:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274186450] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:23,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178222690] [2022-12-14 15:24:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:23,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:23,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:23,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:23,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:23,872 INFO L87 Difference]: Start difference. First operand 11041 states and 33042 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:24,608 INFO L93 Difference]: Finished difference Result 12782 states and 37639 transitions. [2022-12-14 15:24:24,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:24:24,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:24,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:24,633 INFO L225 Difference]: With dead ends: 12782 [2022-12-14 15:24:24,633 INFO L226 Difference]: Without dead ends: 12782 [2022-12-14 15:24:24,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:24:24,633 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 183 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:24,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 18 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2022-12-14 15:24:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 11321. [2022-12-14 15:24:24,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11321 states, 11169 states have (on average 3.0293669979407287) internal successors, (33835), 11320 states have internal predecessors, (33835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11321 states to 11321 states and 33835 transitions. [2022-12-14 15:24:24,808 INFO L78 Accepts]: Start accepts. Automaton has 11321 states and 33835 transitions. Word has length 24 [2022-12-14 15:24:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:24,808 INFO L495 AbstractCegarLoop]: Abstraction has 11321 states and 33835 transitions. [2022-12-14 15:24:24,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 11321 states and 33835 transitions. [2022-12-14 15:24:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:24,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:24,811 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-12-14 15:24:24,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-12-14 15:24:24,811 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:24,811 INFO L85 PathProgramCache]: Analyzing trace with hash 705704874, now seen corresponding path program 3 times [2022-12-14 15:24:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309352929] [2022-12-14 15:24:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:24,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:25,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309352929] [2022-12-14 15:24:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309352929] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:25,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628952634] [2022-12-14 15:24:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:25,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:25,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:25,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:25,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:25,201 INFO L87 Difference]: Start difference. First operand 11321 states and 33835 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:25,800 INFO L93 Difference]: Finished difference Result 12617 states and 37130 transitions. [2022-12-14 15:24:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:24:25,801 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:25,827 INFO L225 Difference]: With dead ends: 12617 [2022-12-14 15:24:25,827 INFO L226 Difference]: Without dead ends: 12617 [2022-12-14 15:24:25,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:24:25,827 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 183 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:25,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 21 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:24:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12617 states. [2022-12-14 15:24:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12617 to 11180. [2022-12-14 15:24:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11180 states, 11028 states have (on average 3.0270221254987306) internal successors, (33382), 11179 states have internal predecessors, (33382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11180 states to 11180 states and 33382 transitions. [2022-12-14 15:24:26,003 INFO L78 Accepts]: Start accepts. Automaton has 11180 states and 33382 transitions. Word has length 24 [2022-12-14 15:24:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:26,003 INFO L495 AbstractCegarLoop]: Abstraction has 11180 states and 33382 transitions. [2022-12-14 15:24:26,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 11180 states and 33382 transitions. [2022-12-14 15:24:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:26,006 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:26,006 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-12-14 15:24:26,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-12-14 15:24:26,006 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:26,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1001115489, now seen corresponding path program 2 times [2022-12-14 15:24:26,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:26,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075020711] [2022-12-14 15:24:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:26,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:26,333 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:26,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075020711] [2022-12-14 15:24:26,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075020711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:26,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:26,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154353307] [2022-12-14 15:24:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:26,334 INFO L87 Difference]: Start difference. First operand 11180 states and 33382 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:27,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:27,148 INFO L93 Difference]: Finished difference Result 13240 states and 38873 transitions. [2022-12-14 15:24:27,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:27,149 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:27,174 INFO L225 Difference]: With dead ends: 13240 [2022-12-14 15:24:27,174 INFO L226 Difference]: Without dead ends: 13240 [2022-12-14 15:24:27,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:24:27,174 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 163 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:27,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 17 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:27,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2022-12-14 15:24:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 11322. [2022-12-14 15:24:27,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11322 states, 11170 states have (on average 3.0273052820053716) internal successors, (33815), 11321 states have internal predecessors, (33815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11322 states to 11322 states and 33815 transitions. [2022-12-14 15:24:27,353 INFO L78 Accepts]: Start accepts. Automaton has 11322 states and 33815 transitions. Word has length 24 [2022-12-14 15:24:27,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:27,353 INFO L495 AbstractCegarLoop]: Abstraction has 11322 states and 33815 transitions. [2022-12-14 15:24:27,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 11322 states and 33815 transitions. [2022-12-14 15:24:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:27,356 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:27,356 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-12-14 15:24:27,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-12-14 15:24:27,356 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1001115407, now seen corresponding path program 2 times [2022-12-14 15:24:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:27,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562350786] [2022-12-14 15:24:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:27,689 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:27,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562350786] [2022-12-14 15:24:27,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562350786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:27,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:27,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323375016] [2022-12-14 15:24:27,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:27,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:27,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:27,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:27,691 INFO L87 Difference]: Start difference. First operand 11322 states and 33815 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:28,484 INFO L93 Difference]: Finished difference Result 13016 states and 38199 transitions. [2022-12-14 15:24:28,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:28,485 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:28,509 INFO L225 Difference]: With dead ends: 13016 [2022-12-14 15:24:28,510 INFO L226 Difference]: Without dead ends: 13016 [2022-12-14 15:24:28,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:28,510 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 244 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:28,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 16 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13016 states. [2022-12-14 15:24:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13016 to 11198. [2022-12-14 15:24:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11198 states, 11046 states have (on average 3.0271591526344377) internal successors, (33438), 11197 states have internal predecessors, (33438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11198 states to 11198 states and 33438 transitions. [2022-12-14 15:24:28,686 INFO L78 Accepts]: Start accepts. Automaton has 11198 states and 33438 transitions. Word has length 24 [2022-12-14 15:24:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:28,686 INFO L495 AbstractCegarLoop]: Abstraction has 11198 states and 33438 transitions. [2022-12-14 15:24:28,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:28,686 INFO L276 IsEmpty]: Start isEmpty. Operand 11198 states and 33438 transitions. [2022-12-14 15:24:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:28,688 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:28,688 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-12-14 15:24:28,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-12-14 15:24:28,689 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:28,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:28,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2001107643, now seen corresponding path program 3 times [2022-12-14 15:24:28,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:28,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720727067] [2022-12-14 15:24:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:28,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:29,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720727067] [2022-12-14 15:24:29,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720727067] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:29,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:29,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:24:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989210493] [2022-12-14 15:24:29,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:29,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:24:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:29,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:24:29,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:24:29,088 INFO L87 Difference]: Start difference. First operand 11198 states and 33438 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:30,207 INFO L93 Difference]: Finished difference Result 13196 states and 38736 transitions. [2022-12-14 15:24:30,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:24:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:30,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:30,234 INFO L225 Difference]: With dead ends: 13196 [2022-12-14 15:24:30,235 INFO L226 Difference]: Without dead ends: 13196 [2022-12-14 15:24:30,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:24:30,235 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 235 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:30,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 31 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:24:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13196 states. [2022-12-14 15:24:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13196 to 11486. [2022-12-14 15:24:30,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11486 states, 11334 states have (on average 3.020381154049762) internal successors, (34233), 11485 states have internal predecessors, (34233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11486 states to 11486 states and 34233 transitions. [2022-12-14 15:24:30,419 INFO L78 Accepts]: Start accepts. Automaton has 11486 states and 34233 transitions. Word has length 24 [2022-12-14 15:24:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:30,419 INFO L495 AbstractCegarLoop]: Abstraction has 11486 states and 34233 transitions. [2022-12-14 15:24:30,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:30,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11486 states and 34233 transitions. [2022-12-14 15:24:30,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:30,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:30,422 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-12-14 15:24:30,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-12-14 15:24:30,422 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:30,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:30,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2001107561, now seen corresponding path program 3 times [2022-12-14 15:24:30,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:30,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586868705] [2022-12-14 15:24:30,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:30,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:30,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586868705] [2022-12-14 15:24:30,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586868705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:30,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:30,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59984358] [2022-12-14 15:24:30,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:30,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:30,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:30,765 INFO L87 Difference]: Start difference. First operand 11486 states and 34233 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:31,654 INFO L93 Difference]: Finished difference Result 12829 states and 37677 transitions. [2022-12-14 15:24:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:31,679 INFO L225 Difference]: With dead ends: 12829 [2022-12-14 15:24:31,679 INFO L226 Difference]: Without dead ends: 12829 [2022-12-14 15:24:31,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:31,679 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 231 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:31,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 29 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:24:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2022-12-14 15:24:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 11362. [2022-12-14 15:24:31,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11362 states, 11210 states have (on average 3.0201605709188226) internal successors, (33856), 11361 states have internal predecessors, (33856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11362 states to 11362 states and 33856 transitions. [2022-12-14 15:24:31,855 INFO L78 Accepts]: Start accepts. Automaton has 11362 states and 33856 transitions. Word has length 24 [2022-12-14 15:24:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:31,855 INFO L495 AbstractCegarLoop]: Abstraction has 11362 states and 33856 transitions. [2022-12-14 15:24:31,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 11362 states and 33856 transitions. [2022-12-14 15:24:31,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:31,858 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:31,858 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-12-14 15:24:31,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-12-14 15:24:31,858 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:31,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1693666557, now seen corresponding path program 4 times [2022-12-14 15:24:31,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:31,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448662220] [2022-12-14 15:24:31,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:31,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:32,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:32,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:32,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448662220] [2022-12-14 15:24:32,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448662220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:32,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:32,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874903452] [2022-12-14 15:24:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:32,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:32,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:32,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:32,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:32,195 INFO L87 Difference]: Start difference. First operand 11362 states and 33856 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:33,046 INFO L93 Difference]: Finished difference Result 13441 states and 39356 transitions. [2022-12-14 15:24:33,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:24:33,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:33,072 INFO L225 Difference]: With dead ends: 13441 [2022-12-14 15:24:33,072 INFO L226 Difference]: Without dead ends: 13441 [2022-12-14 15:24:33,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:24:33,073 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 303 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:33,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 25 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13441 states. [2022-12-14 15:24:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13441 to 11487. [2022-12-14 15:24:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11487 states, 11335 states have (on average 3.020555800617556) internal successors, (34238), 11486 states have internal predecessors, (34238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 34238 transitions. [2022-12-14 15:24:33,254 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 34238 transitions. Word has length 24 [2022-12-14 15:24:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:33,254 INFO L495 AbstractCegarLoop]: Abstraction has 11487 states and 34238 transitions. [2022-12-14 15:24:33,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:33,254 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 34238 transitions. [2022-12-14 15:24:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:33,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:33,257 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-12-14 15:24:33,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-12-14 15:24:33,257 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1693666475, now seen corresponding path program 4 times [2022-12-14 15:24:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476696231] [2022-12-14 15:24:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:33,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:33,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476696231] [2022-12-14 15:24:33,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476696231] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:33,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:33,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783463814] [2022-12-14 15:24:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:33,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:33,554 INFO L87 Difference]: Start difference. First operand 11487 states and 34238 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:34,571 INFO L93 Difference]: Finished difference Result 13217 states and 38682 transitions. [2022-12-14 15:24:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:24:34,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:34,597 INFO L225 Difference]: With dead ends: 13217 [2022-12-14 15:24:34,597 INFO L226 Difference]: Without dead ends: 13217 [2022-12-14 15:24:34,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:24:34,597 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 218 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:34,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 30 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:24:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13217 states. [2022-12-14 15:24:34,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13217 to 11363. [2022-12-14 15:24:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11211 states have (on average 3.0203371688520204) internal successors, (33861), 11362 states have internal predecessors, (33861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 33861 transitions. [2022-12-14 15:24:34,777 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 33861 transitions. Word has length 24 [2022-12-14 15:24:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:34,777 INFO L495 AbstractCegarLoop]: Abstraction has 11363 states and 33861 transitions. [2022-12-14 15:24:34,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 33861 transitions. [2022-12-14 15:24:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:34,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:34,780 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-12-14 15:24:34,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-12-14 15:24:34,780 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1601308585, now seen corresponding path program 5 times [2022-12-14 15:24:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:34,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254262936] [2022-12-14 15:24:34,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:35,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:35,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:35,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254262936] [2022-12-14 15:24:35,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254262936] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:35,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:35,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:24:35,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64027055] [2022-12-14 15:24:35,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:24:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:35,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:24:35,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:24:35,146 INFO L87 Difference]: Start difference. First operand 11363 states and 33861 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:36,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:36,606 INFO L93 Difference]: Finished difference Result 13965 states and 40710 transitions. [2022-12-14 15:24:36,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:24:36,607 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:36,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:36,635 INFO L225 Difference]: With dead ends: 13965 [2022-12-14 15:24:36,635 INFO L226 Difference]: Without dead ends: 13965 [2022-12-14 15:24:36,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:24:36,636 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 289 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 2262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:36,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 49 Invalid, 2277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2262 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:24:36,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13965 states. [2022-12-14 15:24:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13965 to 11651. [2022-12-14 15:24:36,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11651 states, 11499 states have (on average 3.013827289329507) internal successors, (34656), 11650 states have internal predecessors, (34656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11651 states to 11651 states and 34656 transitions. [2022-12-14 15:24:36,848 INFO L78 Accepts]: Start accepts. Automaton has 11651 states and 34656 transitions. Word has length 24 [2022-12-14 15:24:36,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:36,848 INFO L495 AbstractCegarLoop]: Abstraction has 11651 states and 34656 transitions. [2022-12-14 15:24:36,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11651 states and 34656 transitions. [2022-12-14 15:24:36,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:36,850 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:36,851 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-12-14 15:24:36,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-12-14 15:24:36,851 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:36,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:36,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1601308667, now seen corresponding path program 5 times [2022-12-14 15:24:36,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:36,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390567595] [2022-12-14 15:24:36,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:36,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:37,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:37,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390567595] [2022-12-14 15:24:37,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390567595] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:37,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:37,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965579646] [2022-12-14 15:24:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:37,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:37,176 INFO L87 Difference]: Start difference. First operand 11651 states and 34656 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:38,320 INFO L93 Difference]: Finished difference Result 13551 states and 39533 transitions. [2022-12-14 15:24:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:24:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:38,348 INFO L225 Difference]: With dead ends: 13551 [2022-12-14 15:24:38,348 INFO L226 Difference]: Without dead ends: 13551 [2022-12-14 15:24:38,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:24:38,349 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 241 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:38,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 39 Invalid, 1661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:24:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13551 states. [2022-12-14 15:24:38,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13551 to 11342. [2022-12-14 15:24:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11342 states, 11190 states have (on average 3.0200178731009832) internal successors, (33794), 11341 states have internal predecessors, (33794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11342 states to 11342 states and 33794 transitions. [2022-12-14 15:24:38,539 INFO L78 Accepts]: Start accepts. Automaton has 11342 states and 33794 transitions. Word has length 24 [2022-12-14 15:24:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:38,540 INFO L495 AbstractCegarLoop]: Abstraction has 11342 states and 33794 transitions. [2022-12-14 15:24:38,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 11342 states and 33794 transitions. [2022-12-14 15:24:38,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:38,542 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:38,542 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-12-14 15:24:38,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-12-14 15:24:38,543 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:38,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:38,543 INFO L85 PathProgramCache]: Analyzing trace with hash -393741374, now seen corresponding path program 4 times [2022-12-14 15:24:38,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:38,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590848207] [2022-12-14 15:24:38,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:38,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:38,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:38,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590848207] [2022-12-14 15:24:38,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590848207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:38,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:38,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136519416] [2022-12-14 15:24:38,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:38,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:38,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:38,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:38,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:38,893 INFO L87 Difference]: Start difference. First operand 11342 states and 33794 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:39,934 INFO L93 Difference]: Finished difference Result 13332 states and 39052 transitions. [2022-12-14 15:24:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:24:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:39,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:39,961 INFO L225 Difference]: With dead ends: 13332 [2022-12-14 15:24:39,961 INFO L226 Difference]: Without dead ends: 13332 [2022-12-14 15:24:39,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:39,962 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 235 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:39,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 26 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:24:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13332 states. [2022-12-14 15:24:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13332 to 11482. [2022-12-14 15:24:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11482 states, 11330 states have (on average 3.0223300970873788) internal successors, (34243), 11481 states have internal predecessors, (34243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:40,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11482 states to 11482 states and 34243 transitions. [2022-12-14 15:24:40,147 INFO L78 Accepts]: Start accepts. Automaton has 11482 states and 34243 transitions. Word has length 24 [2022-12-14 15:24:40,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:40,147 INFO L495 AbstractCegarLoop]: Abstraction has 11482 states and 34243 transitions. [2022-12-14 15:24:40,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:40,147 INFO L276 IsEmpty]: Start isEmpty. Operand 11482 states and 34243 transitions. [2022-12-14 15:24:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:40,150 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:40,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:40,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-12-14 15:24:40,150 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -393741292, now seen corresponding path program 4 times [2022-12-14 15:24:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:40,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63982482] [2022-12-14 15:24:40,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:40,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:40,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63982482] [2022-12-14 15:24:40,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63982482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:40,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:40,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373004421] [2022-12-14 15:24:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:40,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:40,528 INFO L87 Difference]: Start difference. First operand 11482 states and 34243 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:41,447 INFO L93 Difference]: Finished difference Result 13119 states and 38407 transitions. [2022-12-14 15:24:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:24:41,448 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:41,474 INFO L225 Difference]: With dead ends: 13119 [2022-12-14 15:24:41,475 INFO L226 Difference]: Without dead ends: 13119 [2022-12-14 15:24:41,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:24:41,475 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 232 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:41,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 32 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:24:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13119 states. [2022-12-14 15:24:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13119 to 11340. [2022-12-14 15:24:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11340 states, 11188 states have (on average 3.020110833035395) internal successors, (33789), 11339 states have internal predecessors, (33789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11340 states to 11340 states and 33789 transitions. [2022-12-14 15:24:41,671 INFO L78 Accepts]: Start accepts. Automaton has 11340 states and 33789 transitions. Word has length 24 [2022-12-14 15:24:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:41,672 INFO L495 AbstractCegarLoop]: Abstraction has 11340 states and 33789 transitions. [2022-12-14 15:24:41,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11340 states and 33789 transitions. [2022-12-14 15:24:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:41,676 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:41,676 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-12-14 15:24:41,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-12-14 15:24:41,677 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:41,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1448714252, now seen corresponding path program 5 times [2022-12-14 15:24:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:41,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078122734] [2022-12-14 15:24:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:42,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:42,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078122734] [2022-12-14 15:24:42,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078122734] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:42,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:42,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273594488] [2022-12-14 15:24:42,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:42,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:42,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:42,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:42,043 INFO L87 Difference]: Start difference. First operand 11340 states and 33789 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:42,733 INFO L93 Difference]: Finished difference Result 13565 states and 39681 transitions. [2022-12-14 15:24:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:42,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:42,761 INFO L225 Difference]: With dead ends: 13565 [2022-12-14 15:24:42,761 INFO L226 Difference]: Without dead ends: 13565 [2022-12-14 15:24:42,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:24:42,762 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 250 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:42,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 29 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:42,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13565 states. [2022-12-14 15:24:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13565 to 11620. [2022-12-14 15:24:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11620 states, 11468 states have (on average 3.0155214509940707) internal successors, (34582), 11619 states have internal predecessors, (34582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:42,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11620 states to 11620 states and 34582 transitions. [2022-12-14 15:24:42,987 INFO L78 Accepts]: Start accepts. Automaton has 11620 states and 34582 transitions. Word has length 24 [2022-12-14 15:24:42,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:42,987 INFO L495 AbstractCegarLoop]: Abstraction has 11620 states and 34582 transitions. [2022-12-14 15:24:42,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 11620 states and 34582 transitions. [2022-12-14 15:24:42,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:42,990 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:42,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:42,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-12-14 15:24:42,990 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1448714170, now seen corresponding path program 5 times [2022-12-14 15:24:42,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:42,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757479468] [2022-12-14 15:24:42,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:42,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:43,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:43,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757479468] [2022-12-14 15:24:43,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757479468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:43,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:43,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:43,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137921384] [2022-12-14 15:24:43,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:43,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:43,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:43,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:43,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:43,287 INFO L87 Difference]: Start difference. First operand 11620 states and 34582 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:44,081 INFO L93 Difference]: Finished difference Result 13352 states and 39036 transitions. [2022-12-14 15:24:44,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:24:44,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:44,107 INFO L225 Difference]: With dead ends: 13352 [2022-12-14 15:24:44,107 INFO L226 Difference]: Without dead ends: 13352 [2022-12-14 15:24:44,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:24:44,108 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 215 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:44,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 30 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13352 states. [2022-12-14 15:24:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13352 to 11312. [2022-12-14 15:24:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11312 states, 11160 states have (on average 3.0198028673835124) internal successors, (33701), 11311 states have internal predecessors, (33701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11312 states to 11312 states and 33701 transitions. [2022-12-14 15:24:44,288 INFO L78 Accepts]: Start accepts. Automaton has 11312 states and 33701 transitions. Word has length 24 [2022-12-14 15:24:44,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:44,288 INFO L495 AbstractCegarLoop]: Abstraction has 11312 states and 33701 transitions. [2022-12-14 15:24:44,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11312 states and 33701 transitions. [2022-12-14 15:24:44,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:44,291 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:44,291 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-12-14 15:24:44,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-12-14 15:24:44,291 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:44,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:44,291 INFO L85 PathProgramCache]: Analyzing trace with hash -466969528, now seen corresponding path program 6 times [2022-12-14 15:24:44,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:44,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954399563] [2022-12-14 15:24:44,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:44,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:44,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:44,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954399563] [2022-12-14 15:24:44,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954399563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:44,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:44,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315190230] [2022-12-14 15:24:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:44,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:44,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:44,548 INFO L87 Difference]: Start difference. First operand 11312 states and 33701 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:45,306 INFO L93 Difference]: Finished difference Result 13332 states and 39065 transitions. [2022-12-14 15:24:45,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:24:45,307 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:45,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:45,332 INFO L225 Difference]: With dead ends: 13332 [2022-12-14 15:24:45,333 INFO L226 Difference]: Without dead ends: 13332 [2022-12-14 15:24:45,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:24:45,333 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 196 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:45,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 35 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:45,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13332 states. [2022-12-14 15:24:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13332 to 11472. [2022-12-14 15:24:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 11320 states have (on average 3.0187279151943462) internal successors, (34172), 11471 states have internal predecessors, (34172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 34172 transitions. [2022-12-14 15:24:45,516 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 34172 transitions. Word has length 24 [2022-12-14 15:24:45,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:45,516 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 34172 transitions. [2022-12-14 15:24:45,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 34172 transitions. [2022-12-14 15:24:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:45,519 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:45,519 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-12-14 15:24:45,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-12-14 15:24:45,519 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash -466969446, now seen corresponding path program 6 times [2022-12-14 15:24:45,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:45,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323041621] [2022-12-14 15:24:45,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:45,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-12-14 15:24:45,830 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:45,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323041621] [2022-12-14 15:24:45,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323041621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:45,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:24:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744924008] [2022-12-14 15:24:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:45,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:24:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:24:45,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:45,831 INFO L87 Difference]: Start difference. First operand 11472 states and 34172 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:46,721 INFO L93 Difference]: Finished difference Result 13143 states and 38482 transitions. [2022-12-14 15:24:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:24:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:46,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:46,747 INFO L225 Difference]: With dead ends: 13143 [2022-12-14 15:24:46,747 INFO L226 Difference]: Without dead ends: 13143 [2022-12-14 15:24:46,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:24:46,747 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 206 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:46,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 42 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:24:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13143 states. [2022-12-14 15:24:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13143 to 11192. [2022-12-14 15:24:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11192 states, 11040 states have (on average 3.0234601449275362) internal successors, (33379), 11191 states have internal predecessors, (33379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11192 states to 11192 states and 33379 transitions. [2022-12-14 15:24:46,924 INFO L78 Accepts]: Start accepts. Automaton has 11192 states and 33379 transitions. Word has length 24 [2022-12-14 15:24:46,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:46,925 INFO L495 AbstractCegarLoop]: Abstraction has 11192 states and 33379 transitions. [2022-12-14 15:24:46,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:46,925 INFO L276 IsEmpty]: Start isEmpty. Operand 11192 states and 33379 transitions. [2022-12-14 15:24:46,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:46,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:46,927 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-12-14 15:24:46,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-12-14 15:24:46,927 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 348905450, now seen corresponding path program 7 times [2022-12-14 15:24:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988972579] [2022-12-14 15:24:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:46,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:47,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:47,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988972579] [2022-12-14 15:24:47,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988972579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:47,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:47,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:47,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342868109] [2022-12-14 15:24:47,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:47,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:47,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:47,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:47,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:47,176 INFO L87 Difference]: Start difference. First operand 11192 states and 33379 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:47,938 INFO L93 Difference]: Finished difference Result 13192 states and 38707 transitions. [2022-12-14 15:24:47,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:24:47,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:47,964 INFO L225 Difference]: With dead ends: 13192 [2022-12-14 15:24:47,964 INFO L226 Difference]: Without dead ends: 13192 [2022-12-14 15:24:47,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:24:47,965 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 192 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:47,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 27 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13192 states. [2022-12-14 15:24:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13192 to 11335. [2022-12-14 15:24:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11335 states, 11183 states have (on average 3.023786103907717) internal successors, (33815), 11334 states have internal predecessors, (33815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:48,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 33815 transitions. [2022-12-14 15:24:48,144 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 33815 transitions. Word has length 24 [2022-12-14 15:24:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:48,144 INFO L495 AbstractCegarLoop]: Abstraction has 11335 states and 33815 transitions. [2022-12-14 15:24:48,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:48,145 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 33815 transitions. [2022-12-14 15:24:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:48,147 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:48,147 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-12-14 15:24:48,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-12-14 15:24:48,147 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:48,147 INFO L85 PathProgramCache]: Analyzing trace with hash 348905532, now seen corresponding path program 7 times [2022-12-14 15:24:48,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:48,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343413475] [2022-12-14 15:24:48,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:48,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:48,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-12-14 15:24:48,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:48,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343413475] [2022-12-14 15:24:48,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343413475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:48,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:48,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:24:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873997714] [2022-12-14 15:24:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:48,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:24:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:48,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:24:48,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:24:48,443 INFO L87 Difference]: Start difference. First operand 11335 states and 33815 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:49,060 INFO L93 Difference]: Finished difference Result 12979 states and 38062 transitions. [2022-12-14 15:24:49,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:24:49,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:49,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:49,085 INFO L225 Difference]: With dead ends: 12979 [2022-12-14 15:24:49,085 INFO L226 Difference]: Without dead ends: 12979 [2022-12-14 15:24:49,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:24:49,086 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 237 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:49,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 22 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:24:49,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12979 states. [2022-12-14 15:24:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12979 to 11174. [2022-12-14 15:24:49,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11174 states, 11022 states have (on average 3.025131555071675) internal successors, (33343), 11173 states have internal predecessors, (33343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11174 states to 11174 states and 33343 transitions. [2022-12-14 15:24:49,259 INFO L78 Accepts]: Start accepts. Automaton has 11174 states and 33343 transitions. Word has length 24 [2022-12-14 15:24:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:49,259 INFO L495 AbstractCegarLoop]: Abstraction has 11174 states and 33343 transitions. [2022-12-14 15:24:49,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:49,259 INFO L276 IsEmpty]: Start isEmpty. Operand 11174 states and 33343 transitions. [2022-12-14 15:24:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:49,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:49,261 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-12-14 15:24:49,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-12-14 15:24:49,261 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:49,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1545878727, now seen corresponding path program 6 times [2022-12-14 15:24:49,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:49,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838808982] [2022-12-14 15:24:49,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:49,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:49,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:49,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838808982] [2022-12-14 15:24:49,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838808982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:49,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:49,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:24:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906547876] [2022-12-14 15:24:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:49,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:24:49,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:49,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:24:49,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:24:49,650 INFO L87 Difference]: Start difference. First operand 11174 states and 33343 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:51,123 INFO L93 Difference]: Finished difference Result 13415 states and 39198 transitions. [2022-12-14 15:24:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:24:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:51,149 INFO L225 Difference]: With dead ends: 13415 [2022-12-14 15:24:51,149 INFO L226 Difference]: Without dead ends: 13415 [2022-12-14 15:24:51,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2022-12-14 15:24:51,149 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 260 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:51,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 51 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:24:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2022-12-14 15:24:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 11432. [2022-12-14 15:24:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11432 states, 11280 states have (on average 3.0181737588652484) internal successors, (34045), 11431 states have internal predecessors, (34045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:51,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11432 states to 11432 states and 34045 transitions. [2022-12-14 15:24:51,330 INFO L78 Accepts]: Start accepts. Automaton has 11432 states and 34045 transitions. Word has length 24 [2022-12-14 15:24:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:51,330 INFO L495 AbstractCegarLoop]: Abstraction has 11432 states and 34045 transitions. [2022-12-14 15:24:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:51,330 INFO L276 IsEmpty]: Start isEmpty. Operand 11432 states and 34045 transitions. [2022-12-14 15:24:51,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:51,333 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:51,333 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-12-14 15:24:51,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-12-14 15:24:51,333 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:51,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1545878645, now seen corresponding path program 6 times [2022-12-14 15:24:51,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:51,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079123293] [2022-12-14 15:24:51,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:51,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:51,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079123293] [2022-12-14 15:24:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079123293] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:51,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:51,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:51,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297400672] [2022-12-14 15:24:51,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:51,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:51,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:51,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:51,640 INFO L87 Difference]: Start difference. First operand 11432 states and 34045 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:52,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:52,453 INFO L93 Difference]: Finished difference Result 13047 states and 38156 transitions. [2022-12-14 15:24:52,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:24:52,454 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:52,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:52,479 INFO L225 Difference]: With dead ends: 13047 [2022-12-14 15:24:52,479 INFO L226 Difference]: Without dead ends: 13047 [2022-12-14 15:24:52,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:24:52,479 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 241 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1629 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:52,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 43 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1629 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:24:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13047 states. [2022-12-14 15:24:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13047 to 11144. [2022-12-14 15:24:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11144 states, 10992 states have (on average 3.0249272197962154) internal successors, (33250), 11143 states have internal predecessors, (33250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:52,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 33250 transitions. [2022-12-14 15:24:52,656 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 33250 transitions. Word has length 24 [2022-12-14 15:24:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:52,656 INFO L495 AbstractCegarLoop]: Abstraction has 11144 states and 33250 transitions. [2022-12-14 15:24:52,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 33250 transitions. [2022-12-14 15:24:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:52,658 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:52,658 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-12-14 15:24:52,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-12-14 15:24:52,658 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:52,659 INFO L85 PathProgramCache]: Analyzing trace with hash 21516227, now seen corresponding path program 7 times [2022-12-14 15:24:52,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:52,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757066196] [2022-12-14 15:24:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:53,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:53,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757066196] [2022-12-14 15:24:53,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757066196] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:53,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:53,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:24:53,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991170653] [2022-12-14 15:24:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:53,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:24:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:53,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:24:53,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:24:53,027 INFO L87 Difference]: Start difference. First operand 11144 states and 33250 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,367 INFO L93 Difference]: Finished difference Result 13224 states and 38715 transitions. [2022-12-14 15:24:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:24:54,367 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,392 INFO L225 Difference]: With dead ends: 13224 [2022-12-14 15:24:54,392 INFO L226 Difference]: Without dead ends: 13224 [2022-12-14 15:24:54,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2022-12-14 15:24:54,393 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 287 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1795 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 50 Invalid, 1810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1795 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:24:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13224 states. [2022-12-14 15:24:54,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13224 to 11282. [2022-12-14 15:24:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11282 states, 11130 states have (on average 3.0215633423180592) internal successors, (33630), 11281 states have internal predecessors, (33630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11282 states to 11282 states and 33630 transitions. [2022-12-14 15:24:54,575 INFO L78 Accepts]: Start accepts. Automaton has 11282 states and 33630 transitions. Word has length 24 [2022-12-14 15:24:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,575 INFO L495 AbstractCegarLoop]: Abstraction has 11282 states and 33630 transitions. [2022-12-14 15:24:54,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 11282 states and 33630 transitions. [2022-12-14 15:24:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:54,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,577 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-12-14 15:24:54,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-12-14 15:24:54,577 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:54,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash 21516309, now seen corresponding path program 7 times [2022-12-14 15:24:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373421877] [2022-12-14 15:24:54,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373421877] [2022-12-14 15:24:54,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373421877] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:24:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476657905] [2022-12-14 15:24:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:24:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:24:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:24:54,927 INFO L87 Difference]: Start difference. First operand 11282 states and 33630 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:56,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:56,000 INFO L93 Difference]: Finished difference Result 12920 states and 37831 transitions. [2022-12-14 15:24:56,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:24:56,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:24:56,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:56,026 INFO L225 Difference]: With dead ends: 12920 [2022-12-14 15:24:56,026 INFO L226 Difference]: Without dead ends: 12920 [2022-12-14 15:24:56,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:24:56,026 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1826 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:56,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 56 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1826 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:24:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12920 states. [2022-12-14 15:24:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12920 to 11024. [2022-12-14 15:24:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11024 states, 10872 states have (on average 3.0286975717439293) internal successors, (32928), 11023 states have internal predecessors, (32928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 32928 transitions. [2022-12-14 15:24:56,203 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 32928 transitions. Word has length 24 [2022-12-14 15:24:56,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:56,203 INFO L495 AbstractCegarLoop]: Abstraction has 11024 states and 32928 transitions. [2022-12-14 15:24:56,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 32928 transitions. [2022-12-14 15:24:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:24:56,205 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:56,205 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:56,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-12-14 15:24:56,205 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting writer_fnErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:24:56,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:56,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2136543103, now seen corresponding path program 1 times [2022-12-14 15:24:56,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:56,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098498879] [2022-12-14 15:24:56,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:56,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:56,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098498879] [2022-12-14 15:24:56,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098498879] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:56,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932147288] [2022-12-14 15:24:56,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:56,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:56,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:56,980 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:56,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 15:24:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:57,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 49 conjunts are in the unsatisfiable core [2022-12-14 15:24:57,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:57,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:24:57,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:57,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:24:57,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-12-14 15:24:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932147288] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [265588583] [2022-12-14 15:24:57,322 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:24:57,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:24:57,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 27 [2022-12-14 15:24:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922197847] [2022-12-14 15:24:57,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:57,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 15:24:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 15:24:57,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:24:57,323 INFO L87 Difference]: Start difference. First operand 11024 states and 32928 transitions. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:01,990 INFO L93 Difference]: Finished difference Result 19816 states and 54964 transitions. [2022-12-14 15:25:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-12-14 15:25:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:25:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:02,031 INFO L225 Difference]: With dead ends: 19816 [2022-12-14 15:25:02,031 INFO L226 Difference]: Without dead ends: 19712 [2022-12-14 15:25:02,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1175, Invalid=4677, Unknown=0, NotChecked=0, Total=5852 [2022-12-14 15:25:02,032 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1661 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 7313 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 7394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 7313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:02,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 213 Invalid, 7394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 7313 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-12-14 15:25:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19712 states. [2022-12-14 15:25:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19712 to 9421. [2022-12-14 15:25:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9421 states, 9269 states have (on average 2.9721652821232065) internal successors, (27549), 9420 states have internal predecessors, (27549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9421 states to 9421 states and 27549 transitions. [2022-12-14 15:25:02,246 INFO L78 Accepts]: Start accepts. Automaton has 9421 states and 27549 transitions. Word has length 24 [2022-12-14 15:25:02,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:02,246 INFO L495 AbstractCegarLoop]: Abstraction has 9421 states and 27549 transitions. [2022-12-14 15:25:02,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9421 states and 27549 transitions. [2022-12-14 15:25:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:25:02,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:02,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] [2022-12-14 15:25:02,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 15:25:02,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-12-14 15:25:02,449 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1962111043, now seen corresponding path program 8 times [2022-12-14 15:25:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253829517] [2022-12-14 15:25:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:02,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:02,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253829517] [2022-12-14 15:25:02,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253829517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:02,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:02,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:02,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551960019] [2022-12-14 15:25:02,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:02,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:02,776 INFO L87 Difference]: Start difference. First operand 9421 states and 27549 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:03,656 INFO L93 Difference]: Finished difference Result 11136 states and 32005 transitions. [2022-12-14 15:25:03,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:25:03,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:25:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:03,677 INFO L225 Difference]: With dead ends: 11136 [2022-12-14 15:25:03,677 INFO L226 Difference]: Without dead ends: 11136 [2022-12-14 15:25:03,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:25:03,677 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 278 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:03,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 45 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:25:03,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11136 states. [2022-12-14 15:25:03,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11136 to 9496. [2022-12-14 15:25:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9496 states, 9344 states have (on average 2.9721746575342465) internal successors, (27772), 9495 states have internal predecessors, (27772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9496 states to 9496 states and 27772 transitions. [2022-12-14 15:25:03,826 INFO L78 Accepts]: Start accepts. Automaton has 9496 states and 27772 transitions. Word has length 24 [2022-12-14 15:25:03,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:03,827 INFO L495 AbstractCegarLoop]: Abstraction has 9496 states and 27772 transitions. [2022-12-14 15:25:03,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:03,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9496 states and 27772 transitions. [2022-12-14 15:25:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 15:25:03,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:03,829 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-12-14 15:25:03,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-12-14 15:25:03,829 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:03,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:03,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1962111125, now seen corresponding path program 8 times [2022-12-14 15:25:03,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:03,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666641653] [2022-12-14 15:25:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:03,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:04,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:04,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666641653] [2022-12-14 15:25:04,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666641653] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:04,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:04,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141154630] [2022-12-14 15:25:04,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:04,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:04,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:04,143 INFO L87 Difference]: Start difference. First operand 9496 states and 27772 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:04,980 INFO L93 Difference]: Finished difference Result 10920 states and 31368 transitions. [2022-12-14 15:25:04,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:04,981 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 15:25:04,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:04,999 INFO L225 Difference]: With dead ends: 10920 [2022-12-14 15:25:04,999 INFO L226 Difference]: Without dead ends: 10920 [2022-12-14 15:25:04,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:05,000 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 293 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:05,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 33 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:25:05,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2022-12-14 15:25:05,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 9355. [2022-12-14 15:25:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9355 states, 9203 states have (on average 2.976203411930892) internal successors, (27390), 9354 states have internal predecessors, (27390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:05,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9355 states to 9355 states and 27390 transitions. [2022-12-14 15:25:05,142 INFO L78 Accepts]: Start accepts. Automaton has 9355 states and 27390 transitions. Word has length 24 [2022-12-14 15:25:05,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:05,142 INFO L495 AbstractCegarLoop]: Abstraction has 9355 states and 27390 transitions. [2022-12-14 15:25:05,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9355 states and 27390 transitions. [2022-12-14 15:25:05,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:05,144 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:05,144 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-12-14 15:25:05,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-12-14 15:25:05,144 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:05,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:05,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1715978760, now seen corresponding path program 1 times [2022-12-14 15:25:05,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:05,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149232244] [2022-12-14 15:25:05,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:05,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:05,578 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:05,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149232244] [2022-12-14 15:25:05,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149232244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:05,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:05,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:05,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784314545] [2022-12-14 15:25:05,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:05,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:05,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:05,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:05,579 INFO L87 Difference]: Start difference. First operand 9355 states and 27390 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:06,118 INFO L93 Difference]: Finished difference Result 11021 states and 31831 transitions. [2022-12-14 15:25:06,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:06,119 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:06,139 INFO L225 Difference]: With dead ends: 11021 [2022-12-14 15:25:06,139 INFO L226 Difference]: Without dead ends: 11021 [2022-12-14 15:25:06,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:25:06,139 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 241 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:06,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 9 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:25:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11021 states. [2022-12-14 15:25:06,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11021 to 9597. [2022-12-14 15:25:06,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9597 states, 9445 states have (on average 2.9835892006352567) internal successors, (28180), 9596 states have internal predecessors, (28180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9597 states to 9597 states and 28180 transitions. [2022-12-14 15:25:06,288 INFO L78 Accepts]: Start accepts. Automaton has 9597 states and 28180 transitions. Word has length 26 [2022-12-14 15:25:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 9597 states and 28180 transitions. [2022-12-14 15:25:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 9597 states and 28180 transitions. [2022-12-14 15:25:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:06,290 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:06,290 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-12-14 15:25:06,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-12-14 15:25:06,290 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:06,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1715978678, now seen corresponding path program 1 times [2022-12-14 15:25:06,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:06,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629998949] [2022-12-14 15:25:06,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:06,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:06,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:06,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629998949] [2022-12-14 15:25:06,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629998949] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:06,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:06,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783179297] [2022-12-14 15:25:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:06,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:06,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:06,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:06,725 INFO L87 Difference]: Start difference. First operand 9597 states and 28180 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:07,643 INFO L93 Difference]: Finished difference Result 10749 states and 31068 transitions. [2022-12-14 15:25:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:07,643 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:07,661 INFO L225 Difference]: With dead ends: 10749 [2022-12-14 15:25:07,662 INFO L226 Difference]: Without dead ends: 10749 [2022-12-14 15:25:07,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:07,662 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 228 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:07,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 11 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10749 states. [2022-12-14 15:25:07,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10749 to 9521. [2022-12-14 15:25:07,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9521 states, 9369 states have (on average 2.9806809691535916) internal successors, (27926), 9520 states have internal predecessors, (27926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9521 states to 9521 states and 27926 transitions. [2022-12-14 15:25:07,820 INFO L78 Accepts]: Start accepts. Automaton has 9521 states and 27926 transitions. Word has length 26 [2022-12-14 15:25:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:07,820 INFO L495 AbstractCegarLoop]: Abstraction has 9521 states and 27926 transitions. [2022-12-14 15:25:07,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 9521 states and 27926 transitions. [2022-12-14 15:25:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:07,822 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:07,822 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-12-14 15:25:07,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-12-14 15:25:07,822 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:07,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:07,823 INFO L85 PathProgramCache]: Analyzing trace with hash -777278170, now seen corresponding path program 1 times [2022-12-14 15:25:07,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:07,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031948305] [2022-12-14 15:25:07,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:07,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:08,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:08,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031948305] [2022-12-14 15:25:08,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031948305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:08,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:08,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543426463] [2022-12-14 15:25:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:08,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:08,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:08,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:08,268 INFO L87 Difference]: Start difference. First operand 9521 states and 27926 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:09,059 INFO L93 Difference]: Finished difference Result 9563 states and 28016 transitions. [2022-12-14 15:25:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:25:09,060 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:09,076 INFO L225 Difference]: With dead ends: 9563 [2022-12-14 15:25:09,076 INFO L226 Difference]: Without dead ends: 9563 [2022-12-14 15:25:09,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:25:09,076 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 93 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:09,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 9 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9563 states. [2022-12-14 15:25:09,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9563 to 9542. [2022-12-14 15:25:09,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9542 states, 9390 states have (on average 2.9794462193823215) internal successors, (27977), 9541 states have internal predecessors, (27977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9542 states to 9542 states and 27977 transitions. [2022-12-14 15:25:09,208 INFO L78 Accepts]: Start accepts. Automaton has 9542 states and 27977 transitions. Word has length 26 [2022-12-14 15:25:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:09,208 INFO L495 AbstractCegarLoop]: Abstraction has 9542 states and 27977 transitions. [2022-12-14 15:25:09,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 9542 states and 27977 transitions. [2022-12-14 15:25:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:09,210 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:09,210 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-12-14 15:25:09,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-12-14 15:25:09,211 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:09,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:09,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1649151565, now seen corresponding path program 1 times [2022-12-14 15:25:09,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:09,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883026238] [2022-12-14 15:25:09,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:09,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:09,620 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:09,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883026238] [2022-12-14 15:25:09,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883026238] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:09,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:09,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:09,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736415560] [2022-12-14 15:25:09,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:09,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:09,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:09,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:09,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:09,621 INFO L87 Difference]: Start difference. First operand 9542 states and 27977 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:10,539 INFO L93 Difference]: Finished difference Result 11167 states and 32196 transitions. [2022-12-14 15:25:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:10,559 INFO L225 Difference]: With dead ends: 11167 [2022-12-14 15:25:10,559 INFO L226 Difference]: Without dead ends: 11167 [2022-12-14 15:25:10,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:10,559 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 214 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:10,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 11 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11167 states. [2022-12-14 15:25:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11167 to 9747. [2022-12-14 15:25:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9747 states, 9595 states have (on average 2.98019801980198) internal successors, (28595), 9746 states have internal predecessors, (28595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9747 states to 9747 states and 28595 transitions. [2022-12-14 15:25:10,707 INFO L78 Accepts]: Start accepts. Automaton has 9747 states and 28595 transitions. Word has length 26 [2022-12-14 15:25:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:10,707 INFO L495 AbstractCegarLoop]: Abstraction has 9747 states and 28595 transitions. [2022-12-14 15:25:10,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 9747 states and 28595 transitions. [2022-12-14 15:25:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:10,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:10,709 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-12-14 15:25:10,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-12-14 15:25:10,709 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:10,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:10,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1649151483, now seen corresponding path program 1 times [2022-12-14 15:25:10,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:10,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433973620] [2022-12-14 15:25:10,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:10,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:11,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:11,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433973620] [2022-12-14 15:25:11,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433973620] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:11,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:11,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:25:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590830470] [2022-12-14 15:25:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:11,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:25:11,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:11,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:25:11,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:25:11,175 INFO L87 Difference]: Start difference. First operand 9747 states and 28595 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:12,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:12,233 INFO L93 Difference]: Finished difference Result 10901 states and 31459 transitions. [2022-12-14 15:25:12,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:12,234 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:12,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:12,252 INFO L225 Difference]: With dead ends: 10901 [2022-12-14 15:25:12,252 INFO L226 Difference]: Without dead ends: 10901 [2022-12-14 15:25:12,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:12,253 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 242 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:12,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 11 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:12,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10901 states. [2022-12-14 15:25:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10901 to 9687. [2022-12-14 15:25:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9687 states, 9535 states have (on average 2.980073413738857) internal successors, (28415), 9686 states have internal predecessors, (28415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9687 states to 9687 states and 28415 transitions. [2022-12-14 15:25:12,398 INFO L78 Accepts]: Start accepts. Automaton has 9687 states and 28415 transitions. Word has length 26 [2022-12-14 15:25:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:12,398 INFO L495 AbstractCegarLoop]: Abstraction has 9687 states and 28415 transitions. [2022-12-14 15:25:12,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 9687 states and 28415 transitions. [2022-12-14 15:25:12,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:12,401 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:12,401 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-12-14 15:25:12,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-12-14 15:25:12,401 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:12,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1259447935, now seen corresponding path program 1 times [2022-12-14 15:25:12,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:12,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697999225] [2022-12-14 15:25:12,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:12,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:12,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:12,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697999225] [2022-12-14 15:25:12,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697999225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:12,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:12,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:12,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264852103] [2022-12-14 15:25:12,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:12,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:12,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:12,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:12,901 INFO L87 Difference]: Start difference. First operand 9687 states and 28415 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:13,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:13,773 INFO L93 Difference]: Finished difference Result 9735 states and 28521 transitions. [2022-12-14 15:25:13,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:25:13,774 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:13,790 INFO L225 Difference]: With dead ends: 9735 [2022-12-14 15:25:13,790 INFO L226 Difference]: Without dead ends: 9735 [2022-12-14 15:25:13,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:25:13,790 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 98 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1033 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:13,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 11 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1033 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9735 states. [2022-12-14 15:25:13,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9735 to 9710. [2022-12-14 15:25:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9710 states, 9558 states have (on average 2.9788658715212386) internal successors, (28472), 9709 states have internal predecessors, (28472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9710 states to 9710 states and 28472 transitions. [2022-12-14 15:25:13,921 INFO L78 Accepts]: Start accepts. Automaton has 9710 states and 28472 transitions. Word has length 26 [2022-12-14 15:25:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:13,922 INFO L495 AbstractCegarLoop]: Abstraction has 9710 states and 28472 transitions. [2022-12-14 15:25:13,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9710 states and 28472 transitions. [2022-12-14 15:25:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:13,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:13,924 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-12-14 15:25:13,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-12-14 15:25:13,924 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:13,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:13,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1144541870, now seen corresponding path program 2 times [2022-12-14 15:25:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:13,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836479287] [2022-12-14 15:25:13,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:13,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:14,455 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:14,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836479287] [2022-12-14 15:25:14,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836479287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:14,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:14,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128146354] [2022-12-14 15:25:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:14,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:14,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:14,456 INFO L87 Difference]: Start difference. First operand 9710 states and 28472 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:15,589 INFO L93 Difference]: Finished difference Result 11812 states and 34148 transitions. [2022-12-14 15:25:15,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:15,589 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:15,609 INFO L225 Difference]: With dead ends: 11812 [2022-12-14 15:25:15,609 INFO L226 Difference]: Without dead ends: 11812 [2022-12-14 15:25:15,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:15,610 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 228 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:15,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 15 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:25:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11812 states. [2022-12-14 15:25:15,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11812 to 9975. [2022-12-14 15:25:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9975 states, 9823 states have (on average 2.9859513386948997) internal successors, (29331), 9974 states have internal predecessors, (29331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9975 states to 9975 states and 29331 transitions. [2022-12-14 15:25:15,764 INFO L78 Accepts]: Start accepts. Automaton has 9975 states and 29331 transitions. Word has length 26 [2022-12-14 15:25:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:15,764 INFO L495 AbstractCegarLoop]: Abstraction has 9975 states and 29331 transitions. [2022-12-14 15:25:15,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 9975 states and 29331 transitions. [2022-12-14 15:25:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:15,767 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:15,767 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-12-14 15:25:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-12-14 15:25:15,767 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:15,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1144541788, now seen corresponding path program 2 times [2022-12-14 15:25:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:15,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981272228] [2022-12-14 15:25:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:15,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:16,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:16,201 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:16,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981272228] [2022-12-14 15:25:16,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981272228] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:16,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:16,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:16,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476454297] [2022-12-14 15:25:16,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:16,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:16,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:16,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:16,202 INFO L87 Difference]: Start difference. First operand 9975 states and 29331 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:16,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:16,986 INFO L93 Difference]: Finished difference Result 11540 states and 33385 transitions. [2022-12-14 15:25:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:25:16,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:17,007 INFO L225 Difference]: With dead ends: 11540 [2022-12-14 15:25:17,007 INFO L226 Difference]: Without dead ends: 11540 [2022-12-14 15:25:17,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:25:17,008 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 237 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 16 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11540 states. [2022-12-14 15:25:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11540 to 9737. [2022-12-14 15:25:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9737 states, 9585 states have (on average 2.979134063641106) internal successors, (28555), 9736 states have internal predecessors, (28555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:17,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9737 states to 9737 states and 28555 transitions. [2022-12-14 15:25:17,159 INFO L78 Accepts]: Start accepts. Automaton has 9737 states and 28555 transitions. Word has length 26 [2022-12-14 15:25:17,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:17,160 INFO L495 AbstractCegarLoop]: Abstraction has 9737 states and 28555 transitions. [2022-12-14 15:25:17,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:17,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9737 states and 28555 transitions. [2022-12-14 15:25:17,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:17,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:17,162 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-12-14 15:25:17,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-12-14 15:25:17,163 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:17,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash -205841280, now seen corresponding path program 2 times [2022-12-14 15:25:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:17,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710004921] [2022-12-14 15:25:17,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:17,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:17,567 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:17,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710004921] [2022-12-14 15:25:17,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710004921] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:17,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:17,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-14 15:25:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097773778] [2022-12-14 15:25:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:17,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 15:25:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:17,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 15:25:17,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-12-14 15:25:17,568 INFO L87 Difference]: Start difference. First operand 9737 states and 28555 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:18,445 INFO L93 Difference]: Finished difference Result 10044 states and 29293 transitions. [2022-12-14 15:25:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:25:18,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:18,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:18,464 INFO L225 Difference]: With dead ends: 10044 [2022-12-14 15:25:18,464 INFO L226 Difference]: Without dead ends: 10044 [2022-12-14 15:25:18,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:25:18,464 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 144 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:18,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 12 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:18,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10044 states. [2022-12-14 15:25:18,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10044 to 9761. [2022-12-14 15:25:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9761 states, 9609 states have (on average 2.978249557706317) internal successors, (28618), 9760 states have internal predecessors, (28618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9761 states to 9761 states and 28618 transitions. [2022-12-14 15:25:18,603 INFO L78 Accepts]: Start accepts. Automaton has 9761 states and 28618 transitions. Word has length 26 [2022-12-14 15:25:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:18,603 INFO L495 AbstractCegarLoop]: Abstraction has 9761 states and 28618 transitions. [2022-12-14 15:25:18,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 9761 states and 28618 transitions. [2022-12-14 15:25:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:18,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:18,606 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-12-14 15:25:18,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-12-14 15:25:18,606 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:18,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:18,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1361195772, now seen corresponding path program 3 times [2022-12-14 15:25:18,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:18,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127711321] [2022-12-14 15:25:18,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:19,043 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:19,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127711321] [2022-12-14 15:25:19,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127711321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:19,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:19,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380510605] [2022-12-14 15:25:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:19,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:19,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:19,045 INFO L87 Difference]: Start difference. First operand 9761 states and 28618 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:20,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:20,156 INFO L93 Difference]: Finished difference Result 11894 states and 34354 transitions. [2022-12-14 15:25:20,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:20,157 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:20,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:20,177 INFO L225 Difference]: With dead ends: 11894 [2022-12-14 15:25:20,177 INFO L226 Difference]: Without dead ends: 11894 [2022-12-14 15:25:20,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:25:20,177 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 233 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:20,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 22 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:25:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2022-12-14 15:25:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 10101. [2022-12-14 15:25:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10101 states, 9949 states have (on average 2.9813046537340435) internal successors, (29661), 10100 states have internal predecessors, (29661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:20,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10101 states to 10101 states and 29661 transitions. [2022-12-14 15:25:20,332 INFO L78 Accepts]: Start accepts. Automaton has 10101 states and 29661 transitions. Word has length 26 [2022-12-14 15:25:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:20,332 INFO L495 AbstractCegarLoop]: Abstraction has 10101 states and 29661 transitions. [2022-12-14 15:25:20,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 10101 states and 29661 transitions. [2022-12-14 15:25:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:20,335 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:20,335 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-12-14 15:25:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2022-12-14 15:25:20,335 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:20,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1361195690, now seen corresponding path program 3 times [2022-12-14 15:25:20,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:20,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530650550] [2022-12-14 15:25:20,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:20,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:20,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:20,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530650550] [2022-12-14 15:25:20,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530650550] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:20,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:20,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:20,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29166798] [2022-12-14 15:25:20,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:20,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:20,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:20,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:20,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:20,788 INFO L87 Difference]: Start difference. First operand 10101 states and 29661 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:21,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:21,762 INFO L93 Difference]: Finished difference Result 11660 states and 33699 transitions. [2022-12-14 15:25:21,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:21,763 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:21,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:21,783 INFO L225 Difference]: With dead ends: 11660 [2022-12-14 15:25:21,783 INFO L226 Difference]: Without dead ends: 11660 [2022-12-14 15:25:21,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:25:21,783 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 206 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:21,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 23 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:25:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11660 states. [2022-12-14 15:25:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11660 to 9869. [2022-12-14 15:25:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9869 states, 9717 states have (on average 2.9746835443037973) internal successors, (28905), 9868 states have internal predecessors, (28905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9869 states to 9869 states and 28905 transitions. [2022-12-14 15:25:21,933 INFO L78 Accepts]: Start accepts. Automaton has 9869 states and 28905 transitions. Word has length 26 [2022-12-14 15:25:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:21,933 INFO L495 AbstractCegarLoop]: Abstraction has 9869 states and 28905 transitions. [2022-12-14 15:25:21,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 9869 states and 28905 transitions. [2022-12-14 15:25:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:21,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:21,936 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-12-14 15:25:21,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2022-12-14 15:25:21,936 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:21,936 INFO L85 PathProgramCache]: Analyzing trace with hash -422495182, now seen corresponding path program 3 times [2022-12-14 15:25:21,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:21,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014212410] [2022-12-14 15:25:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:22,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:22,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014212410] [2022-12-14 15:25:22,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014212410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:22,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:22,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479485961] [2022-12-14 15:25:22,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:22,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:22,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:22,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:22,397 INFO L87 Difference]: Start difference. First operand 9869 states and 28905 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:23,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:23,298 INFO L93 Difference]: Finished difference Result 10021 states and 29203 transitions. [2022-12-14 15:25:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:23,299 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:23,316 INFO L225 Difference]: With dead ends: 10021 [2022-12-14 15:25:23,316 INFO L226 Difference]: Without dead ends: 10021 [2022-12-14 15:25:23,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:25:23,317 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 121 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:23,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 22 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10021 states. [2022-12-14 15:25:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10021 to 9875. [2022-12-14 15:25:23,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9875 states, 9723 states have (on average 2.9701738146662553) internal successors, (28879), 9874 states have internal predecessors, (28879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9875 states to 9875 states and 28879 transitions. [2022-12-14 15:25:23,454 INFO L78 Accepts]: Start accepts. Automaton has 9875 states and 28879 transitions. Word has length 26 [2022-12-14 15:25:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:23,454 INFO L495 AbstractCegarLoop]: Abstraction has 9875 states and 28879 transitions. [2022-12-14 15:25:23,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 9875 states and 28879 transitions. [2022-12-14 15:25:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:23,457 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:23,457 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-12-14 15:25:23,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2022-12-14 15:25:23,457 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash -319607582, now seen corresponding path program 4 times [2022-12-14 15:25:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:23,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591168425] [2022-12-14 15:25:23,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:23,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:23,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591168425] [2022-12-14 15:25:23,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591168425] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:23,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:23,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:23,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741290689] [2022-12-14 15:25:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:23,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:23,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:23,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:23,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:23,900 INFO L87 Difference]: Start difference. First operand 9875 states and 28879 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:24,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:24,740 INFO L93 Difference]: Finished difference Result 10027 states and 29217 transitions. [2022-12-14 15:25:24,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:24,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:24,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:24,758 INFO L225 Difference]: With dead ends: 10027 [2022-12-14 15:25:24,758 INFO L226 Difference]: Without dead ends: 10027 [2022-12-14 15:25:24,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=346, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:24,759 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 152 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:24,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 22 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:25:24,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10027 states. [2022-12-14 15:25:24,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10027 to 9863. [2022-12-14 15:25:24,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9863 states, 9711 states have (on average 2.970960766141489) internal successors, (28851), 9862 states have internal predecessors, (28851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9863 states to 9863 states and 28851 transitions. [2022-12-14 15:25:24,899 INFO L78 Accepts]: Start accepts. Automaton has 9863 states and 28851 transitions. Word has length 26 [2022-12-14 15:25:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:24,899 INFO L495 AbstractCegarLoop]: Abstraction has 9863 states and 28851 transitions. [2022-12-14 15:25:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9863 states and 28851 transitions. [2022-12-14 15:25:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:24,902 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:24,902 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-12-14 15:25:24,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2022-12-14 15:25:24,902 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:24,903 INFO L85 PathProgramCache]: Analyzing trace with hash -927259978, now seen corresponding path program 4 times [2022-12-14 15:25:24,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:24,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571374996] [2022-12-14 15:25:24,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:24,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:25,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:25,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:25,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571374996] [2022-12-14 15:25:25,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571374996] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:25,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:25,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524874836] [2022-12-14 15:25:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:25,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:25,309 INFO L87 Difference]: Start difference. First operand 9863 states and 28851 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:26,220 INFO L93 Difference]: Finished difference Result 11894 states and 34281 transitions. [2022-12-14 15:25:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:25:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:26,243 INFO L225 Difference]: With dead ends: 11894 [2022-12-14 15:25:26,243 INFO L226 Difference]: Without dead ends: 11894 [2022-12-14 15:25:26,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:25:26,243 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 209 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:26,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 22 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11894 states. [2022-12-14 15:25:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11894 to 10423. [2022-12-14 15:25:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10423 states, 10271 states have (on average 2.970791549021517) internal successors, (30513), 10422 states have internal predecessors, (30513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:26,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10423 states to 10423 states and 30513 transitions. [2022-12-14 15:25:26,410 INFO L78 Accepts]: Start accepts. Automaton has 10423 states and 30513 transitions. Word has length 26 [2022-12-14 15:25:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:26,410 INFO L495 AbstractCegarLoop]: Abstraction has 10423 states and 30513 transitions. [2022-12-14 15:25:26,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:26,410 INFO L276 IsEmpty]: Start isEmpty. Operand 10423 states and 30513 transitions. [2022-12-14 15:25:26,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:26,413 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:26,413 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-12-14 15:25:26,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2022-12-14 15:25:26,413 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:26,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash -927259896, now seen corresponding path program 4 times [2022-12-14 15:25:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:26,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367596700] [2022-12-14 15:25:26,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:26,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:26,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:26,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367596700] [2022-12-14 15:25:26,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367596700] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:26,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:26,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:26,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598061724] [2022-12-14 15:25:26,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:26,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:26,795 INFO L87 Difference]: Start difference. First operand 10423 states and 30513 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:27,605 INFO L93 Difference]: Finished difference Result 11622 states and 33518 transitions. [2022-12-14 15:25:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:25:27,606 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:27,627 INFO L225 Difference]: With dead ends: 11622 [2022-12-14 15:25:27,627 INFO L226 Difference]: Without dead ends: 11622 [2022-12-14 15:25:27,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:25:27,627 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 229 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:27,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 23 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11622 states. [2022-12-14 15:25:27,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11622 to 10198. [2022-12-14 15:25:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10198 states, 10046 states have (on average 2.9635675890901854) internal successors, (29772), 10197 states have internal predecessors, (29772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10198 states to 10198 states and 29772 transitions. [2022-12-14 15:25:27,790 INFO L78 Accepts]: Start accepts. Automaton has 10198 states and 29772 transitions. Word has length 26 [2022-12-14 15:25:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:27,791 INFO L495 AbstractCegarLoop]: Abstraction has 10198 states and 29772 transitions. [2022-12-14 15:25:27,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10198 states and 29772 transitions. [2022-12-14 15:25:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:27,794 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:27,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:27,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2022-12-14 15:25:27,794 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:27,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1236192060, now seen corresponding path program 5 times [2022-12-14 15:25:27,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:27,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388759822] [2022-12-14 15:25:27,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:27,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:28,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:28,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388759822] [2022-12-14 15:25:28,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388759822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:28,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:28,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:28,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474034468] [2022-12-14 15:25:28,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:28,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:28,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:28,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:28,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:28,271 INFO L87 Difference]: Start difference. First operand 10198 states and 29772 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:29,053 INFO L93 Difference]: Finished difference Result 10297 states and 29974 transitions. [2022-12-14 15:25:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:25:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:29,070 INFO L225 Difference]: With dead ends: 10297 [2022-12-14 15:25:29,070 INFO L226 Difference]: Without dead ends: 10297 [2022-12-14 15:25:29,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:25:29,071 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 181 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:29,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 21 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:25:29,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10297 states. [2022-12-14 15:25:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10297 to 10156. [2022-12-14 15:25:29,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10156 states, 10004 states have (on average 2.964814074370252) internal successors, (29660), 10155 states have internal predecessors, (29660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10156 states to 10156 states and 29660 transitions. [2022-12-14 15:25:29,216 INFO L78 Accepts]: Start accepts. Automaton has 10156 states and 29660 transitions. Word has length 26 [2022-12-14 15:25:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:29,216 INFO L495 AbstractCegarLoop]: Abstraction has 10156 states and 29660 transitions. [2022-12-14 15:25:29,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10156 states and 29660 transitions. [2022-12-14 15:25:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:29,219 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:29,219 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-12-14 15:25:29,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2022-12-14 15:25:29,219 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:29,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:29,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1387089645, now seen corresponding path program 2 times [2022-12-14 15:25:29,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:29,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569662835] [2022-12-14 15:25:29,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:29,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:29,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:29,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569662835] [2022-12-14 15:25:29,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569662835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:29,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:29,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795978292] [2022-12-14 15:25:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:29,701 INFO L87 Difference]: Start difference. First operand 10156 states and 29660 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:30,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:30,649 INFO L93 Difference]: Finished difference Result 12255 states and 35147 transitions. [2022-12-14 15:25:30,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:30,649 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:30,671 INFO L225 Difference]: With dead ends: 12255 [2022-12-14 15:25:30,671 INFO L226 Difference]: Without dead ends: 12255 [2022-12-14 15:25:30,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:25:30,672 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 299 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:30,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 16 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:30,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12255 states. [2022-12-14 15:25:30,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12255 to 10376. [2022-12-14 15:25:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10376 states, 10224 states have (on average 2.9660602503912363) internal successors, (30325), 10375 states have internal predecessors, (30325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:30,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 30325 transitions. [2022-12-14 15:25:30,837 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 30325 transitions. Word has length 26 [2022-12-14 15:25:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:30,837 INFO L495 AbstractCegarLoop]: Abstraction has 10376 states and 30325 transitions. [2022-12-14 15:25:30,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 30325 transitions. [2022-12-14 15:25:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:30,841 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:30,841 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-12-14 15:25:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2022-12-14 15:25:30,841 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1387089727, now seen corresponding path program 2 times [2022-12-14 15:25:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909708472] [2022-12-14 15:25:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:31,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:31,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909708472] [2022-12-14 15:25:31,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909708472] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:31,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:31,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:25:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323542770] [2022-12-14 15:25:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:31,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:25:31,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:31,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:25:31,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:25:31,253 INFO L87 Difference]: Start difference. First operand 10376 states and 30325 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:32,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:32,448 INFO L93 Difference]: Finished difference Result 11989 states and 34410 transitions. [2022-12-14 15:25:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:32,469 INFO L225 Difference]: With dead ends: 11989 [2022-12-14 15:25:32,469 INFO L226 Difference]: Without dead ends: 11989 [2022-12-14 15:25:32,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:32,469 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 242 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:32,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 19 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:25:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11989 states. [2022-12-14 15:25:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11989 to 10174. [2022-12-14 15:25:32,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10174 states, 10022 states have (on average 2.965076830971862) internal successors, (29716), 10173 states have internal predecessors, (29716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10174 states to 10174 states and 29716 transitions. [2022-12-14 15:25:32,623 INFO L78 Accepts]: Start accepts. Automaton has 10174 states and 29716 transitions. Word has length 26 [2022-12-14 15:25:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:32,623 INFO L495 AbstractCegarLoop]: Abstraction has 10174 states and 29716 transitions. [2022-12-14 15:25:32,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 10174 states and 29716 transitions. [2022-12-14 15:25:32,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:32,627 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:32,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:32,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2022-12-14 15:25:32,627 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:32,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash 721849, now seen corresponding path program 2 times [2022-12-14 15:25:32,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:32,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640033590] [2022-12-14 15:25:32,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:32,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:33,035 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:33,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640033590] [2022-12-14 15:25:33,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640033590] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:33,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:33,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839909852] [2022-12-14 15:25:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:33,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:33,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:33,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:33,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:33,036 INFO L87 Difference]: Start difference. First operand 10174 states and 29716 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:33,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:33,743 INFO L93 Difference]: Finished difference Result 10548 states and 30633 transitions. [2022-12-14 15:25:33,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:25:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:33,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:33,762 INFO L225 Difference]: With dead ends: 10548 [2022-12-14 15:25:33,762 INFO L226 Difference]: Without dead ends: 10548 [2022-12-14 15:25:33,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:33,763 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 168 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:33,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 10 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:25:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2022-12-14 15:25:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 10172. [2022-12-14 15:25:33,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10172 states, 10020 states have (on average 2.965069860279441) internal successors, (29710), 10171 states have internal predecessors, (29710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10172 states to 10172 states and 29710 transitions. [2022-12-14 15:25:33,913 INFO L78 Accepts]: Start accepts. Automaton has 10172 states and 29710 transitions. Word has length 26 [2022-12-14 15:25:33,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:33,913 INFO L495 AbstractCegarLoop]: Abstraction has 10172 states and 29710 transitions. [2022-12-14 15:25:33,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:33,914 INFO L276 IsEmpty]: Start isEmpty. Operand 10172 states and 29710 transitions. [2022-12-14 15:25:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:33,916 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:33,917 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-12-14 15:25:33,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2022-12-14 15:25:33,917 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1827663341, now seen corresponding path program 3 times [2022-12-14 15:25:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:33,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380864207] [2022-12-14 15:25:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:34,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:34,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:34,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380864207] [2022-12-14 15:25:34,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380864207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:34,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:34,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:34,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309335277] [2022-12-14 15:25:34,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:34,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:34,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:34,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:34,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:34,397 INFO L87 Difference]: Start difference. First operand 10172 states and 29710 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:35,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:35,964 INFO L93 Difference]: Finished difference Result 12615 states and 36015 transitions. [2022-12-14 15:25:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:25:35,964 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:35,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:35,986 INFO L225 Difference]: With dead ends: 12615 [2022-12-14 15:25:35,986 INFO L226 Difference]: Without dead ends: 12615 [2022-12-14 15:25:35,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:25:35,986 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 292 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:35,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 43 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:25:35,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12615 states. [2022-12-14 15:25:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12615 to 10778. [2022-12-14 15:25:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10778 states, 10626 states have (on average 2.9490871447393188) internal successors, (31337), 10777 states have internal predecessors, (31337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:36,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10778 states to 10778 states and 31337 transitions. [2022-12-14 15:25:36,152 INFO L78 Accepts]: Start accepts. Automaton has 10778 states and 31337 transitions. Word has length 26 [2022-12-14 15:25:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:36,152 INFO L495 AbstractCegarLoop]: Abstraction has 10778 states and 31337 transitions. [2022-12-14 15:25:36,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 10778 states and 31337 transitions. [2022-12-14 15:25:36,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:36,156 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:36,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2022-12-14 15:25:36,156 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1827663259, now seen corresponding path program 3 times [2022-12-14 15:25:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349472318] [2022-12-14 15:25:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:36,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:36,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:36,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349472318] [2022-12-14 15:25:36,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349472318] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:36,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:36,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:36,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273120175] [2022-12-14 15:25:36,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:36,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:36,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:36,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:36,655 INFO L87 Difference]: Start difference. First operand 10778 states and 31337 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:37,831 INFO L93 Difference]: Finished difference Result 12335 states and 35240 transitions. [2022-12-14 15:25:37,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:25:37,832 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:37,855 INFO L225 Difference]: With dead ends: 12335 [2022-12-14 15:25:37,855 INFO L226 Difference]: Without dead ends: 12335 [2022-12-14 15:25:37,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:25:37,855 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 342 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:37,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 33 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:25:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2022-12-14 15:25:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 10576. [2022-12-14 15:25:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10576 states, 10424 states have (on average 2.947812739831159) internal successors, (30728), 10575 states have internal predecessors, (30728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10576 states to 10576 states and 30728 transitions. [2022-12-14 15:25:38,023 INFO L78 Accepts]: Start accepts. Automaton has 10576 states and 30728 transitions. Word has length 26 [2022-12-14 15:25:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:38,023 INFO L495 AbstractCegarLoop]: Abstraction has 10576 states and 30728 transitions. [2022-12-14 15:25:38,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 10576 states and 30728 transitions. [2022-12-14 15:25:38,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:38,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:38,026 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-12-14 15:25:38,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2022-12-14 15:25:38,027 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1080936159, now seen corresponding path program 3 times [2022-12-14 15:25:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:38,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132229547] [2022-12-14 15:25:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:38,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:38,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132229547] [2022-12-14 15:25:38,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132229547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:38,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:38,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879454899] [2022-12-14 15:25:38,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:38,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:38,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:38,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:38,525 INFO L87 Difference]: Start difference. First operand 10576 states and 30728 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:39,768 INFO L93 Difference]: Finished difference Result 10786 states and 31206 transitions. [2022-12-14 15:25:39,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:39,768 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:39,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:39,786 INFO L225 Difference]: With dead ends: 10786 [2022-12-14 15:25:39,786 INFO L226 Difference]: Without dead ends: 10786 [2022-12-14 15:25:39,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=375, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:25:39,787 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 200 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:39,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 28 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10786 states. [2022-12-14 15:25:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10786 to 10579. [2022-12-14 15:25:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10579 states, 10427 states have (on average 2.947923659729548) internal successors, (30738), 10578 states have internal predecessors, (30738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:39,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10579 states to 10579 states and 30738 transitions. [2022-12-14 15:25:39,933 INFO L78 Accepts]: Start accepts. Automaton has 10579 states and 30738 transitions. Word has length 26 [2022-12-14 15:25:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:39,933 INFO L495 AbstractCegarLoop]: Abstraction has 10579 states and 30738 transitions. [2022-12-14 15:25:39,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:39,933 INFO L276 IsEmpty]: Start isEmpty. Operand 10579 states and 30738 transitions. [2022-12-14 15:25:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:39,936 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:39,936 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-12-14 15:25:39,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2022-12-14 15:25:39,936 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:39,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1889354953, now seen corresponding path program 4 times [2022-12-14 15:25:39,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:39,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209397979] [2022-12-14 15:25:39,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:39,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:40,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:40,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:40,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209397979] [2022-12-14 15:25:40,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209397979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:40,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:40,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:40,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265057533] [2022-12-14 15:25:40,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:40,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:40,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:40,412 INFO L87 Difference]: Start difference. First operand 10579 states and 30738 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:41,637 INFO L93 Difference]: Finished difference Result 10777 states and 31150 transitions. [2022-12-14 15:25:41,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:25:41,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:41,656 INFO L225 Difference]: With dead ends: 10777 [2022-12-14 15:25:41,656 INFO L226 Difference]: Without dead ends: 10777 [2022-12-14 15:25:41,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:25:41,656 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 205 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:41,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 30 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:25:41,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10777 states. [2022-12-14 15:25:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10777 to 10569. [2022-12-14 15:25:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10569 states, 10417 states have (on average 2.9444177786310837) internal successors, (30672), 10568 states have internal predecessors, (30672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10569 states to 10569 states and 30672 transitions. [2022-12-14 15:25:41,804 INFO L78 Accepts]: Start accepts. Automaton has 10569 states and 30672 transitions. Word has length 26 [2022-12-14 15:25:41,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:41,804 INFO L495 AbstractCegarLoop]: Abstraction has 10569 states and 30672 transitions. [2022-12-14 15:25:41,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:41,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10569 states and 30672 transitions. [2022-12-14 15:25:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:41,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:41,807 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-12-14 15:25:41,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2022-12-14 15:25:41,808 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:41,808 INFO L85 PathProgramCache]: Analyzing trace with hash -49808125, now seen corresponding path program 5 times [2022-12-14 15:25:41,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:41,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061147793] [2022-12-14 15:25:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:42,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:42,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061147793] [2022-12-14 15:25:42,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061147793] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:42,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:42,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:42,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545730280] [2022-12-14 15:25:42,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:42,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:42,360 INFO L87 Difference]: Start difference. First operand 10569 states and 30672 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:43,416 INFO L93 Difference]: Finished difference Result 10712 states and 30984 transitions. [2022-12-14 15:25:43,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:43,416 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:43,435 INFO L225 Difference]: With dead ends: 10712 [2022-12-14 15:25:43,435 INFO L226 Difference]: Without dead ends: 10712 [2022-12-14 15:25:43,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:43,435 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 188 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:43,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 29 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10712 states. [2022-12-14 15:25:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10712 to 10557. [2022-12-14 15:25:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10557 states, 10405 states have (on average 2.944545891398366) internal successors, (30638), 10556 states have internal predecessors, (30638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10557 states to 10557 states and 30638 transitions. [2022-12-14 15:25:43,586 INFO L78 Accepts]: Start accepts. Automaton has 10557 states and 30638 transitions. Word has length 26 [2022-12-14 15:25:43,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:43,586 INFO L495 AbstractCegarLoop]: Abstraction has 10557 states and 30638 transitions. [2022-12-14 15:25:43,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10557 states and 30638 transitions. [2022-12-14 15:25:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:43,589 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:43,590 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-12-14 15:25:43,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2022-12-14 15:25:43,590 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:43,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:43,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1565444177, now seen corresponding path program 4 times [2022-12-14 15:25:43,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:43,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902948432] [2022-12-14 15:25:43,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:43,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:44,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:44,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:44,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902948432] [2022-12-14 15:25:44,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902948432] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:44,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:44,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27940006] [2022-12-14 15:25:44,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:44,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:44,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:44,061 INFO L87 Difference]: Start difference. First operand 10557 states and 30638 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:45,184 INFO L93 Difference]: Finished difference Result 12636 states and 35940 transitions. [2022-12-14 15:25:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:25:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:45,206 INFO L225 Difference]: With dead ends: 12636 [2022-12-14 15:25:45,206 INFO L226 Difference]: Without dead ends: 12636 [2022-12-14 15:25:45,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=549, Unknown=0, NotChecked=0, Total=702 [2022-12-14 15:25:45,207 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 266 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1884 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:45,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 33 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:25:45,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12636 states. [2022-12-14 15:25:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12636 to 10760. [2022-12-14 15:25:45,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10760 states, 10608 states have (on average 2.946078431372549) internal successors, (31252), 10759 states have internal predecessors, (31252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10760 states to 10760 states and 31252 transitions. [2022-12-14 15:25:45,371 INFO L78 Accepts]: Start accepts. Automaton has 10760 states and 31252 transitions. Word has length 26 [2022-12-14 15:25:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:45,371 INFO L495 AbstractCegarLoop]: Abstraction has 10760 states and 31252 transitions. [2022-12-14 15:25:45,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:45,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10760 states and 31252 transitions. [2022-12-14 15:25:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:45,375 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:45,375 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-12-14 15:25:45,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2022-12-14 15:25:45,375 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:45,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1565444259, now seen corresponding path program 4 times [2022-12-14 15:25:45,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:45,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266211776] [2022-12-14 15:25:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:45,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:45,884 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:45,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266211776] [2022-12-14 15:25:45,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266211776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:45,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:45,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:25:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668386954] [2022-12-14 15:25:45,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:45,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:25:45,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:45,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:25:45,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:25:45,885 INFO L87 Difference]: Start difference. First operand 10760 states and 31252 transitions. Second operand has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:46,735 INFO L93 Difference]: Finished difference Result 12370 states and 35203 transitions. [2022-12-14 15:25:46,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:25:46,736 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:46,758 INFO L225 Difference]: With dead ends: 12370 [2022-12-14 15:25:46,758 INFO L226 Difference]: Without dead ends: 12370 [2022-12-14 15:25:46,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:25:46,758 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 230 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1718 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:46,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 30 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1718 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:25:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12370 states. [2022-12-14 15:25:46,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12370 to 10610. [2022-12-14 15:25:46,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10610 states, 10458 states have (on average 2.9450181679097343) internal successors, (30799), 10609 states have internal predecessors, (30799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10610 states to 10610 states and 30799 transitions. [2022-12-14 15:25:46,919 INFO L78 Accepts]: Start accepts. Automaton has 10610 states and 30799 transitions. Word has length 26 [2022-12-14 15:25:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 10610 states and 30799 transitions. [2022-12-14 15:25:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10610 states and 30799 transitions. [2022-12-14 15:25:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:46,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:46,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:46,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2022-12-14 15:25:46,923 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:46,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 179076381, now seen corresponding path program 6 times [2022-12-14 15:25:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:46,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661684897] [2022-12-14 15:25:46,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:46,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:47,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:47,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661684897] [2022-12-14 15:25:47,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661684897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:47,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:47,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708081496] [2022-12-14 15:25:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:47,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:47,865 INFO L87 Difference]: Start difference. First operand 10610 states and 30799 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:48,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:48,786 INFO L93 Difference]: Finished difference Result 10805 states and 31242 transitions. [2022-12-14 15:25:48,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:25:48,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:48,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:48,804 INFO L225 Difference]: With dead ends: 10805 [2022-12-14 15:25:48,804 INFO L226 Difference]: Without dead ends: 10805 [2022-12-14 15:25:48,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:25:48,805 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 103 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:48,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 22 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2022-12-14 15:25:48,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 10626. [2022-12-14 15:25:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10626 states, 10474 states have (on average 2.9443383616574375) internal successors, (30839), 10625 states have internal predecessors, (30839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10626 states to 10626 states and 30839 transitions. [2022-12-14 15:25:48,953 INFO L78 Accepts]: Start accepts. Automaton has 10626 states and 30839 transitions. Word has length 26 [2022-12-14 15:25:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:48,954 INFO L495 AbstractCegarLoop]: Abstraction has 10626 states and 30839 transitions. [2022-12-14 15:25:48,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:48,954 INFO L276 IsEmpty]: Start isEmpty. Operand 10626 states and 30839 transitions. [2022-12-14 15:25:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:48,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:48,957 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-12-14 15:25:48,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2022-12-14 15:25:48,957 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:48,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:48,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1649308809, now seen corresponding path program 5 times [2022-12-14 15:25:48,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:48,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622326993] [2022-12-14 15:25:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:49,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:49,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622326993] [2022-12-14 15:25:49,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622326993] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:49,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:49,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894009272] [2022-12-14 15:25:49,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:49,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:49,506 INFO L87 Difference]: Start difference. First operand 10626 states and 30839 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:50,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:50,718 INFO L93 Difference]: Finished difference Result 13590 states and 38441 transitions. [2022-12-14 15:25:50,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:25:50,718 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:50,742 INFO L225 Difference]: With dead ends: 13590 [2022-12-14 15:25:50,742 INFO L226 Difference]: Without dead ends: 13590 [2022-12-14 15:25:50,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:25:50,742 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 338 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:50,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 49 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:25:50,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13590 states. [2022-12-14 15:25:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13590 to 11232. [2022-12-14 15:25:50,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11232 states, 11080 states have (on average 2.93014440433213) internal successors, (32466), 11231 states have internal predecessors, (32466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11232 states to 11232 states and 32466 transitions. [2022-12-14 15:25:50,916 INFO L78 Accepts]: Start accepts. Automaton has 11232 states and 32466 transitions. Word has length 26 [2022-12-14 15:25:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:50,917 INFO L495 AbstractCegarLoop]: Abstraction has 11232 states and 32466 transitions. [2022-12-14 15:25:50,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 11232 states and 32466 transitions. [2022-12-14 15:25:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:50,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:50,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:50,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2022-12-14 15:25:50,921 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:50,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1649308727, now seen corresponding path program 5 times [2022-12-14 15:25:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711272517] [2022-12-14 15:25:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:51,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:51,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711272517] [2022-12-14 15:25:51,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711272517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:51,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:51,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:25:51,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684819204] [2022-12-14 15:25:51,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:51,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:25:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:25:51,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:25:51,406 INFO L87 Difference]: Start difference. First operand 11232 states and 32466 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:52,797 INFO L93 Difference]: Finished difference Result 13310 states and 37666 transitions. [2022-12-14 15:25:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:25:52,798 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:52,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:52,821 INFO L225 Difference]: With dead ends: 13310 [2022-12-14 15:25:52,821 INFO L226 Difference]: Without dead ends: 13310 [2022-12-14 15:25:52,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:25:52,821 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 314 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:52,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 54 Invalid, 2328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:25:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2022-12-14 15:25:52,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10789. [2022-12-14 15:25:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10789 states, 10637 states have (on average 2.9380464416658834) internal successors, (31252), 10788 states have internal predecessors, (31252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:52,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10789 states to 10789 states and 31252 transitions. [2022-12-14 15:25:52,992 INFO L78 Accepts]: Start accepts. Automaton has 10789 states and 31252 transitions. Word has length 26 [2022-12-14 15:25:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:52,992 INFO L495 AbstractCegarLoop]: Abstraction has 10789 states and 31252 transitions. [2022-12-14 15:25:52,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 10789 states and 31252 transitions. [2022-12-14 15:25:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:52,996 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:52,996 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-12-14 15:25:52,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2022-12-14 15:25:52,996 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:52,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:52,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1259290691, now seen corresponding path program 7 times [2022-12-14 15:25:52,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:52,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670171175] [2022-12-14 15:25:52,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:52,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:53,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:53,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670171175] [2022-12-14 15:25:53,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670171175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:53,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:53,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551065703] [2022-12-14 15:25:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:53,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:53,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:53,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:53,461 INFO L87 Difference]: Start difference. First operand 10789 states and 31252 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:54,420 INFO L93 Difference]: Finished difference Result 11055 states and 31837 transitions. [2022-12-14 15:25:54,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:25:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:54,458 INFO L225 Difference]: With dead ends: 11055 [2022-12-14 15:25:54,458 INFO L226 Difference]: Without dead ends: 11055 [2022-12-14 15:25:54,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:25:54,458 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:54,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 32 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:25:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11055 states. [2022-12-14 15:25:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11055 to 10810. [2022-12-14 15:25:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10810 states, 10658 states have (on average 2.937136423343967) internal successors, (31304), 10809 states have internal predecessors, (31304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10810 states to 10810 states and 31304 transitions. [2022-12-14 15:25:54,598 INFO L78 Accepts]: Start accepts. Automaton has 10810 states and 31304 transitions. Word has length 26 [2022-12-14 15:25:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:54,598 INFO L495 AbstractCegarLoop]: Abstraction has 10810 states and 31304 transitions. [2022-12-14 15:25:54,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10810 states and 31304 transitions. [2022-12-14 15:25:54,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:54,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:54,602 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-12-14 15:25:54,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2022-12-14 15:25:54,602 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:54,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:54,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2067709485, now seen corresponding path program 8 times [2022-12-14 15:25:54,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:54,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528162058] [2022-12-14 15:25:54,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:54,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:55,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:55,057 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:55,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528162058] [2022-12-14 15:25:55,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528162058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:55,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:55,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:55,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048133773] [2022-12-14 15:25:55,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:55,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:25:55,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:55,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:25:55,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:25:55,058 INFO L87 Difference]: Start difference. First operand 10810 states and 31304 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:56,324 INFO L93 Difference]: Finished difference Result 11064 states and 31823 transitions. [2022-12-14 15:25:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:25:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:56,343 INFO L225 Difference]: With dead ends: 11064 [2022-12-14 15:25:56,343 INFO L226 Difference]: Without dead ends: 11064 [2022-12-14 15:25:56,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:56,344 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 170 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:56,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 45 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11064 states. [2022-12-14 15:25:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11064 to 10793. [2022-12-14 15:25:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10793 states, 10641 states have (on average 2.935062494126492) internal successors, (31232), 10792 states have internal predecessors, (31232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:56,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10793 states to 10793 states and 31232 transitions. [2022-12-14 15:25:56,498 INFO L78 Accepts]: Start accepts. Automaton has 10793 states and 31232 transitions. Word has length 26 [2022-12-14 15:25:56,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:56,498 INFO L495 AbstractCegarLoop]: Abstraction has 10793 states and 31232 transitions. [2022-12-14 15:25:56,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:56,498 INFO L276 IsEmpty]: Start isEmpty. Operand 10793 states and 31232 transitions. [2022-12-14 15:25:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:56,502 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:56,502 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-12-14 15:25:56,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2022-12-14 15:25:56,502 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:56,502 INFO L85 PathProgramCache]: Analyzing trace with hash 128546407, now seen corresponding path program 9 times [2022-12-14 15:25:56,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:56,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298034063] [2022-12-14 15:25:56,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:56,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:56,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:56,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298034063] [2022-12-14 15:25:56,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298034063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:56,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:56,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:25:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748066643] [2022-12-14 15:25:56,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:56,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:25:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:25:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:25:56,982 INFO L87 Difference]: Start difference. First operand 10793 states and 31232 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:58,055 INFO L93 Difference]: Finished difference Result 11365 states and 32551 transitions. [2022-12-14 15:25:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:25:58,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:58,074 INFO L225 Difference]: With dead ends: 11365 [2022-12-14 15:25:58,074 INFO L226 Difference]: Without dead ends: 11365 [2022-12-14 15:25:58,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:25:58,075 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 168 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:58,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 35 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:25:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2022-12-14 15:25:58,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 10535. [2022-12-14 15:25:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10535 states, 10383 states have (on average 2.9444283925647694) internal successors, (30572), 10534 states have internal predecessors, (30572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 30572 transitions. [2022-12-14 15:25:58,224 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 30572 transitions. Word has length 26 [2022-12-14 15:25:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:58,224 INFO L495 AbstractCegarLoop]: Abstraction has 10535 states and 30572 transitions. [2022-12-14 15:25:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 30572 transitions. [2022-12-14 15:25:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:58,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:58,228 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-12-14 15:25:58,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2022-12-14 15:25:58,228 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:58,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:58,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1367006482, now seen corresponding path program 5 times [2022-12-14 15:25:58,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:58,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603474557] [2022-12-14 15:25:58,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:58,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:58,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:58,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603474557] [2022-12-14 15:25:58,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603474557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:25:58,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:25:58,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:25:58,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959759234] [2022-12-14 15:25:58,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:25:58,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:25:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:58,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:25:58,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:25:58,684 INFO L87 Difference]: Start difference. First operand 10535 states and 30572 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:59,682 INFO L93 Difference]: Finished difference Result 12584 states and 35907 transitions. [2022-12-14 15:25:59,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:25:59,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:25:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:59,706 INFO L225 Difference]: With dead ends: 12584 [2022-12-14 15:25:59,706 INFO L226 Difference]: Without dead ends: 12584 [2022-12-14 15:25:59,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:25:59,706 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 300 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:59,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 25 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:25:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12584 states. [2022-12-14 15:25:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12584 to 10771. [2022-12-14 15:25:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10771 states, 10619 states have (on average 2.9515961954986345) internal successors, (31343), 10770 states have internal predecessors, (31343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10771 states to 10771 states and 31343 transitions. [2022-12-14 15:25:59,874 INFO L78 Accepts]: Start accepts. Automaton has 10771 states and 31343 transitions. Word has length 26 [2022-12-14 15:25:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:59,875 INFO L495 AbstractCegarLoop]: Abstraction has 10771 states and 31343 transitions. [2022-12-14 15:25:59,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 10771 states and 31343 transitions. [2022-12-14 15:25:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:25:59,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:59,878 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-12-14 15:25:59,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2022-12-14 15:25:59,878 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:25:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1367006400, now seen corresponding path program 5 times [2022-12-14 15:25:59,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:59,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129867253] [2022-12-14 15:25:59,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:59,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:00,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129867253] [2022-12-14 15:26:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129867253] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653969751] [2022-12-14 15:26:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:00,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:26:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:26:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:26:00,343 INFO L87 Difference]: Start difference. First operand 10771 states and 31343 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:01,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:01,465 INFO L93 Difference]: Finished difference Result 12460 states and 35529 transitions. [2022-12-14 15:26:01,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:26:01,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:01,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:01,487 INFO L225 Difference]: With dead ends: 12460 [2022-12-14 15:26:01,488 INFO L226 Difference]: Without dead ends: 12460 [2022-12-14 15:26:01,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:26:01,488 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 262 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:01,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 36 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12460 states. [2022-12-14 15:26:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12460 to 10581. [2022-12-14 15:26:01,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10581 states, 10429 states have (on average 2.944577620097804) internal successors, (30709), 10580 states have internal predecessors, (30709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10581 states to 10581 states and 30709 transitions. [2022-12-14 15:26:01,652 INFO L78 Accepts]: Start accepts. Automaton has 10581 states and 30709 transitions. Word has length 26 [2022-12-14 15:26:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:01,653 INFO L495 AbstractCegarLoop]: Abstraction has 10581 states and 30709 transitions. [2022-12-14 15:26:01,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 10581 states and 30709 transitions. [2022-12-14 15:26:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:01,656 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:01,656 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-12-14 15:26:01,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2022-12-14 15:26:01,656 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:01,656 INFO L85 PathProgramCache]: Analyzing trace with hash -428305892, now seen corresponding path program 6 times [2022-12-14 15:26:01,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:01,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371226491] [2022-12-14 15:26:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:01,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:02,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:02,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371226491] [2022-12-14 15:26:02,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371226491] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:02,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:02,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302640131] [2022-12-14 15:26:02,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:02,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:02,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:02,110 INFO L87 Difference]: Start difference. First operand 10581 states and 30709 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:02,807 INFO L93 Difference]: Finished difference Result 10710 states and 30977 transitions. [2022-12-14 15:26:02,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:26:02,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:02,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:02,826 INFO L225 Difference]: With dead ends: 10710 [2022-12-14 15:26:02,826 INFO L226 Difference]: Without dead ends: 10710 [2022-12-14 15:26:02,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-12-14 15:26:02,827 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 133 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:02,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 14 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:26:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10710 states. [2022-12-14 15:26:02,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10710 to 10599. [2022-12-14 15:26:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10599 states, 10447 states have (on average 2.943524456781851) internal successors, (30751), 10598 states have internal predecessors, (30751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10599 states to 10599 states and 30751 transitions. [2022-12-14 15:26:02,978 INFO L78 Accepts]: Start accepts. Automaton has 10599 states and 30751 transitions. Word has length 26 [2022-12-14 15:26:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:02,978 INFO L495 AbstractCegarLoop]: Abstraction has 10599 states and 30751 transitions. [2022-12-14 15:26:02,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 10599 states and 30751 transitions. [2022-12-14 15:26:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:02,982 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:02,982 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-12-14 15:26:02,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2022-12-14 15:26:02,982 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:02,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1583660384, now seen corresponding path program 6 times [2022-12-14 15:26:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:02,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641375220] [2022-12-14 15:26:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:02,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:03,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:03,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641375220] [2022-12-14 15:26:03,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641375220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:03,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:03,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:03,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619032369] [2022-12-14 15:26:03,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:03,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:26:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:03,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:26:03,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:26:03,447 INFO L87 Difference]: Start difference. First operand 10599 states and 30751 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:05,030 INFO L93 Difference]: Finished difference Result 13065 states and 37279 transitions. [2022-12-14 15:26:05,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:26:05,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:05,053 INFO L225 Difference]: With dead ends: 13065 [2022-12-14 15:26:05,053 INFO L226 Difference]: Without dead ends: 13065 [2022-12-14 15:26:05,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:26:05,053 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 226 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 2152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:05,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 46 Invalid, 2152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:26:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13065 states. [2022-12-14 15:26:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13065 to 10939. [2022-12-14 15:26:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10939 states, 10787 states have (on average 2.947436729396496) internal successors, (31794), 10938 states have internal predecessors, (31794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10939 states to 10939 states and 31794 transitions. [2022-12-14 15:26:05,224 INFO L78 Accepts]: Start accepts. Automaton has 10939 states and 31794 transitions. Word has length 26 [2022-12-14 15:26:05,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:05,225 INFO L495 AbstractCegarLoop]: Abstraction has 10939 states and 31794 transitions. [2022-12-14 15:26:05,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 10939 states and 31794 transitions. [2022-12-14 15:26:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:05,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:05,229 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-12-14 15:26:05,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2022-12-14 15:26:05,229 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1583660302, now seen corresponding path program 6 times [2022-12-14 15:26:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:05,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917316652] [2022-12-14 15:26:05,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:05,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:05,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917316652] [2022-12-14 15:26:05,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917316652] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:05,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:05,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425634248] [2022-12-14 15:26:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:05,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:26:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:26:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:26:05,766 INFO L87 Difference]: Start difference. First operand 10939 states and 31794 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:06,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:06,891 INFO L93 Difference]: Finished difference Result 12831 states and 36624 transitions. [2022-12-14 15:26:06,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:26:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:06,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:06,915 INFO L225 Difference]: With dead ends: 12831 [2022-12-14 15:26:06,915 INFO L226 Difference]: Without dead ends: 12831 [2022-12-14 15:26:06,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:26:06,915 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 329 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:06,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 31 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12831 states. [2022-12-14 15:26:07,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12831 to 10707. [2022-12-14 15:26:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10707 states, 10555 states have (on average 2.940596873519659) internal successors, (31038), 10706 states have internal predecessors, (31038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10707 states to 10707 states and 31038 transitions. [2022-12-14 15:26:07,082 INFO L78 Accepts]: Start accepts. Automaton has 10707 states and 31038 transitions. Word has length 26 [2022-12-14 15:26:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:07,083 INFO L495 AbstractCegarLoop]: Abstraction has 10707 states and 31038 transitions. [2022-12-14 15:26:07,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 10707 states and 31038 transitions. [2022-12-14 15:26:07,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:07,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:07,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:26:07,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2022-12-14 15:26:07,087 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:07,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash -644959794, now seen corresponding path program 7 times [2022-12-14 15:26:07,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:07,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899324526] [2022-12-14 15:26:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:07,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:07,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:07,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899324526] [2022-12-14 15:26:07,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899324526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102659569] [2022-12-14 15:26:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:07,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:07,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:07,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:07,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:07,513 INFO L87 Difference]: Start difference. First operand 10707 states and 31038 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:08,311 INFO L93 Difference]: Finished difference Result 10841 states and 31278 transitions. [2022-12-14 15:26:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:26:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:08,329 INFO L225 Difference]: With dead ends: 10841 [2022-12-14 15:26:08,329 INFO L226 Difference]: Without dead ends: 10841 [2022-12-14 15:26:08,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:26:08,329 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 110 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:08,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 20 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:26:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10841 states. [2022-12-14 15:26:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10841 to 10705. [2022-12-14 15:26:08,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10705 states, 10553 states have (on average 2.937648062162418) internal successors, (31001), 10704 states have internal predecessors, (31001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10705 states to 10705 states and 31001 transitions. [2022-12-14 15:26:08,477 INFO L78 Accepts]: Start accepts. Automaton has 10705 states and 31001 transitions. Word has length 26 [2022-12-14 15:26:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:08,477 INFO L495 AbstractCegarLoop]: Abstraction has 10705 states and 31001 transitions. [2022-12-14 15:26:08,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:08,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10705 states and 31001 transitions. [2022-12-14 15:26:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:08,481 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:08,481 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-12-14 15:26:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2022-12-14 15:26:08,481 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:08,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -542072194, now seen corresponding path program 8 times [2022-12-14 15:26:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:08,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615843397] [2022-12-14 15:26:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:08,892 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:08,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615843397] [2022-12-14 15:26:08,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615843397] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:08,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:08,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:08,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554396533] [2022-12-14 15:26:08,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:08,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:08,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:08,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:08,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:08,893 INFO L87 Difference]: Start difference. First operand 10705 states and 31001 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:09,893 INFO L93 Difference]: Finished difference Result 10835 states and 31264 transitions. [2022-12-14 15:26:09,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:26:09,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:09,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:09,912 INFO L225 Difference]: With dead ends: 10835 [2022-12-14 15:26:09,912 INFO L226 Difference]: Without dead ends: 10835 [2022-12-14 15:26:09,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:26:09,912 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 168 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:09,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 36 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1180 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:09,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10835 states. [2022-12-14 15:26:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10835 to 10705. [2022-12-14 15:26:10,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10705 states, 10553 states have (on average 2.937648062162418) internal successors, (31001), 10704 states have internal predecessors, (31001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10705 states to 10705 states and 31001 transitions. [2022-12-14 15:26:10,059 INFO L78 Accepts]: Start accepts. Automaton has 10705 states and 31001 transitions. Word has length 26 [2022-12-14 15:26:10,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:10,059 INFO L495 AbstractCegarLoop]: Abstraction has 10705 states and 31001 transitions. [2022-12-14 15:26:10,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:10,060 INFO L276 IsEmpty]: Start isEmpty. Operand 10705 states and 31001 transitions. [2022-12-14 15:26:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:10,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:10,063 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-12-14 15:26:10,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2022-12-14 15:26:10,063 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:10,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1149724590, now seen corresponding path program 7 times [2022-12-14 15:26:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:10,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831120076] [2022-12-14 15:26:10,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:10,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:10,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831120076] [2022-12-14 15:26:10,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831120076] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:10,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:10,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091819784] [2022-12-14 15:26:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:10,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:10,467 INFO L87 Difference]: Start difference. First operand 10705 states and 31001 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:11,557 INFO L93 Difference]: Finished difference Result 13191 states and 37617 transitions. [2022-12-14 15:26:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:26:11,558 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:11,583 INFO L225 Difference]: With dead ends: 13191 [2022-12-14 15:26:11,583 INFO L226 Difference]: Without dead ends: 13191 [2022-12-14 15:26:11,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:26:11,583 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 303 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:11,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 37 Invalid, 1617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13191 states. [2022-12-14 15:26:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13191 to 11265. [2022-12-14 15:26:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11265 states, 11113 states have (on average 2.939170341042023) internal successors, (32663), 11264 states have internal predecessors, (32663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11265 states to 11265 states and 32663 transitions. [2022-12-14 15:26:11,766 INFO L78 Accepts]: Start accepts. Automaton has 11265 states and 32663 transitions. Word has length 26 [2022-12-14 15:26:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:11,766 INFO L495 AbstractCegarLoop]: Abstraction has 11265 states and 32663 transitions. [2022-12-14 15:26:11,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 11265 states and 32663 transitions. [2022-12-14 15:26:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:11,770 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:11,770 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-12-14 15:26:11,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2022-12-14 15:26:11,771 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1149724508, now seen corresponding path program 7 times [2022-12-14 15:26:11,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:11,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150547470] [2022-12-14 15:26:11,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:11,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:12,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:12,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:12,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150547470] [2022-12-14 15:26:12,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150547470] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:12,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:12,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:12,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672586557] [2022-12-14 15:26:12,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:12,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:12,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:12,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:12,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:12,125 INFO L87 Difference]: Start difference. First operand 11265 states and 32663 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:12,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:12,771 INFO L93 Difference]: Finished difference Result 12919 states and 36854 transitions. [2022-12-14 15:26:12,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:26:12,771 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:12,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:12,794 INFO L225 Difference]: With dead ends: 12919 [2022-12-14 15:26:12,794 INFO L226 Difference]: Without dead ends: 12919 [2022-12-14 15:26:12,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:26:12,795 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 256 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:12,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 28 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:26:12,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12919 states. [2022-12-14 15:26:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12919 to 10737. [2022-12-14 15:26:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10737 states, 10585 states have (on average 2.9345299952763346) internal successors, (31062), 10736 states have internal predecessors, (31062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10737 states to 10737 states and 31062 transitions. [2022-12-14 15:26:12,985 INFO L78 Accepts]: Start accepts. Automaton has 10737 states and 31062 transitions. Word has length 26 [2022-12-14 15:26:12,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:12,985 INFO L495 AbstractCegarLoop]: Abstraction has 10737 states and 31062 transitions. [2022-12-14 15:26:12,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 10737 states and 31062 transitions. [2022-12-14 15:26:12,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:12,989 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:12,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] [2022-12-14 15:26:12,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2022-12-14 15:26:12,989 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:12,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:12,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1013727448, now seen corresponding path program 9 times [2022-12-14 15:26:12,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:12,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109213903] [2022-12-14 15:26:12,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:12,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:13,453 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109213903] [2022-12-14 15:26:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109213903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:13,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:13,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161898560] [2022-12-14 15:26:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:13,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:13,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:13,454 INFO L87 Difference]: Start difference. First operand 10737 states and 31062 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:14,478 INFO L93 Difference]: Finished difference Result 11177 states and 32070 transitions. [2022-12-14 15:26:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:26:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:14,498 INFO L225 Difference]: With dead ends: 11177 [2022-12-14 15:26:14,498 INFO L226 Difference]: Without dead ends: 11177 [2022-12-14 15:26:14,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:26:14,498 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 193 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:14,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 36 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11177 states. [2022-12-14 15:26:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11177 to 10503. [2022-12-14 15:26:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10503 states, 10351 states have (on average 2.944256593565839) internal successors, (30476), 10502 states have internal predecessors, (30476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10503 states to 10503 states and 30476 transitions. [2022-12-14 15:26:14,651 INFO L78 Accepts]: Start accepts. Automaton has 10503 states and 30476 transitions. Word has length 26 [2022-12-14 15:26:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:14,651 INFO L495 AbstractCegarLoop]: Abstraction has 10503 states and 30476 transitions. [2022-12-14 15:26:14,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 10503 states and 30476 transitions. [2022-12-14 15:26:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:14,654 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:14,654 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-12-14 15:26:14,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2022-12-14 15:26:14,654 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:14,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1275181556, now seen corresponding path program 8 times [2022-12-14 15:26:14,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:14,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252840971] [2022-12-14 15:26:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:14,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:15,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:15,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252840971] [2022-12-14 15:26:15,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252840971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:15,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:15,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:15,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951255345] [2022-12-14 15:26:15,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:15,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:26:15,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:15,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:26:15,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:26:15,095 INFO L87 Difference]: Start difference. First operand 10503 states and 30476 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:16,195 INFO L93 Difference]: Finished difference Result 12625 states and 36038 transitions. [2022-12-14 15:26:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:26:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:16,218 INFO L225 Difference]: With dead ends: 12625 [2022-12-14 15:26:16,218 INFO L226 Difference]: Without dead ends: 12625 [2022-12-14 15:26:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:26:16,218 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 222 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:16,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 48 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2022-12-14 15:26:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 10723. [2022-12-14 15:26:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10723 states, 10571 states have (on average 2.9515656040109732) internal successors, (31201), 10722 states have internal predecessors, (31201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10723 states to 10723 states and 31201 transitions. [2022-12-14 15:26:16,385 INFO L78 Accepts]: Start accepts. Automaton has 10723 states and 31201 transitions. Word has length 26 [2022-12-14 15:26:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:16,386 INFO L495 AbstractCegarLoop]: Abstraction has 10723 states and 31201 transitions. [2022-12-14 15:26:16,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:16,386 INFO L276 IsEmpty]: Start isEmpty. Operand 10723 states and 31201 transitions. [2022-12-14 15:26:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:16,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:16,389 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-12-14 15:26:16,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2022-12-14 15:26:16,389 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:16,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:16,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1275181638, now seen corresponding path program 8 times [2022-12-14 15:26:16,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:16,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951634884] [2022-12-14 15:26:16,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:16,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:16,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:16,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951634884] [2022-12-14 15:26:16,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951634884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:16,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:16,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208242938] [2022-12-14 15:26:16,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:16,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:26:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:16,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:26:16,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-12-14 15:26:16,798 INFO L87 Difference]: Start difference. First operand 10723 states and 31201 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:17,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:17,840 INFO L93 Difference]: Finished difference Result 12391 states and 35383 transitions. [2022-12-14 15:26:17,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:26:17,841 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:17,862 INFO L225 Difference]: With dead ends: 12391 [2022-12-14 15:26:17,862 INFO L226 Difference]: Without dead ends: 12391 [2022-12-14 15:26:17,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:26:17,862 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 243 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:17,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 44 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12391 states. [2022-12-14 15:26:17,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12391 to 10533. [2022-12-14 15:26:17,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10381 states have (on average 2.944514015990752) internal successors, (30567), 10532 states have internal predecessors, (30567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 30567 transitions. [2022-12-14 15:26:18,020 INFO L78 Accepts]: Start accepts. Automaton has 10533 states and 30567 transitions. Word has length 26 [2022-12-14 15:26:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:18,020 INFO L495 AbstractCegarLoop]: Abstraction has 10533 states and 30567 transitions. [2022-12-14 15:26:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:18,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10533 states and 30567 transitions. [2022-12-14 15:26:18,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:18,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:18,024 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-12-14 15:26:18,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2022-12-14 15:26:18,024 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:18,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2081085150, now seen corresponding path program 10 times [2022-12-14 15:26:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:18,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983795398] [2022-12-14 15:26:18,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:18,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:18,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:18,381 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:18,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983795398] [2022-12-14 15:26:18,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983795398] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:18,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:18,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422604038] [2022-12-14 15:26:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:18,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:18,383 INFO L87 Difference]: Start difference. First operand 10533 states and 30567 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:19,047 INFO L93 Difference]: Finished difference Result 10635 states and 30797 transitions. [2022-12-14 15:26:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 15:26:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:19,065 INFO L225 Difference]: With dead ends: 10635 [2022-12-14 15:26:19,065 INFO L226 Difference]: Without dead ends: 10635 [2022-12-14 15:26:19,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:26:19,065 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 148 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:19,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 19 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 15:26:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10635 states. [2022-12-14 15:26:19,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10635 to 10616. [2022-12-14 15:26:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10616 states, 10464 states have (on average 2.9404625382262997) internal successors, (30769), 10615 states have internal predecessors, (30769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10616 states to 10616 states and 30769 transitions. [2022-12-14 15:26:19,212 INFO L78 Accepts]: Start accepts. Automaton has 10616 states and 30769 transitions. Word has length 26 [2022-12-14 15:26:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:19,212 INFO L495 AbstractCegarLoop]: Abstraction has 10616 states and 30769 transitions. [2022-12-14 15:26:19,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:19,212 INFO L276 IsEmpty]: Start isEmpty. Operand 10616 states and 30769 transitions. [2022-12-14 15:26:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:19,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:19,216 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-12-14 15:26:19,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2022-12-14 15:26:19,216 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:19,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1978197550, now seen corresponding path program 11 times [2022-12-14 15:26:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760567290] [2022-12-14 15:26:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:19,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:19,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760567290] [2022-12-14 15:26:19,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760567290] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:19,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:19,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:19,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067892069] [2022-12-14 15:26:19,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:19,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:19,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:19,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:19,675 INFO L87 Difference]: Start difference. First operand 10616 states and 30769 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:20,502 INFO L93 Difference]: Finished difference Result 10679 states and 30902 transitions. [2022-12-14 15:26:20,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:26:20,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:20,522 INFO L225 Difference]: With dead ends: 10679 [2022-12-14 15:26:20,522 INFO L226 Difference]: Without dead ends: 10679 [2022-12-14 15:26:20,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:26:20,522 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 132 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 858 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:20,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 27 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 858 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:26:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10679 states. [2022-12-14 15:26:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10679 to 10607. [2022-12-14 15:26:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10607 states, 10455 states have (on average 2.940985174557628) internal successors, (30748), 10606 states have internal predecessors, (30748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10607 states to 10607 states and 30748 transitions. [2022-12-14 15:26:20,671 INFO L78 Accepts]: Start accepts. Automaton has 10607 states and 30748 transitions. Word has length 26 [2022-12-14 15:26:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:20,671 INFO L495 AbstractCegarLoop]: Abstraction has 10607 states and 30748 transitions. [2022-12-14 15:26:20,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10607 states and 30748 transitions. [2022-12-14 15:26:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:20,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:20,675 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-12-14 15:26:20,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2022-12-14 15:26:20,675 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:20,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1709117350, now seen corresponding path program 9 times [2022-12-14 15:26:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:20,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603782920] [2022-12-14 15:26:20,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:21,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603782920] [2022-12-14 15:26:21,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603782920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:21,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:21,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:21,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869278221] [2022-12-14 15:26:21,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:21,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:21,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:21,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:21,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:21,018 INFO L87 Difference]: Start difference. First operand 10607 states and 30748 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:22,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:22,599 INFO L93 Difference]: Finished difference Result 13071 states and 37353 transitions. [2022-12-14 15:26:22,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:26:22,599 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:22,622 INFO L225 Difference]: With dead ends: 13071 [2022-12-14 15:26:22,622 INFO L226 Difference]: Without dead ends: 13071 [2022-12-14 15:26:22,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=921, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:26:22,622 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 612 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:22,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 35 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 15:26:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13071 states. [2022-12-14 15:26:22,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13071 to 11139. [2022-12-14 15:26:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11139 states, 10987 states have (on average 2.9447528897788295) internal successors, (32354), 11138 states have internal predecessors, (32354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11139 states to 11139 states and 32354 transitions. [2022-12-14 15:26:22,795 INFO L78 Accepts]: Start accepts. Automaton has 11139 states and 32354 transitions. Word has length 26 [2022-12-14 15:26:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:22,796 INFO L495 AbstractCegarLoop]: Abstraction has 11139 states and 32354 transitions. [2022-12-14 15:26:22,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11139 states and 32354 transitions. [2022-12-14 15:26:22,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:22,800 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:22,800 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-12-14 15:26:22,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2022-12-14 15:26:22,800 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:22,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:22,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1709117432, now seen corresponding path program 9 times [2022-12-14 15:26:22,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:22,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008809454] [2022-12-14 15:26:22,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:22,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:23,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:23,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008809454] [2022-12-14 15:26:23,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008809454] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:23,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:23,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:23,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816135917] [2022-12-14 15:26:23,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:23,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:23,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:23,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:23,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:23,198 INFO L87 Difference]: Start difference. First operand 11139 states and 32354 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:24,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:24,043 INFO L93 Difference]: Finished difference Result 13313 states and 38140 transitions. [2022-12-14 15:26:24,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:26:24,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:24,067 INFO L225 Difference]: With dead ends: 13313 [2022-12-14 15:26:24,068 INFO L226 Difference]: Without dead ends: 13313 [2022-12-14 15:26:24,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:26:24,068 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 231 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1646 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:24,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 42 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13313 states. [2022-12-14 15:26:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13313 to 11169. [2022-12-14 15:26:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11169 states, 11017 states have (on average 2.9417264228011257) internal successors, (32409), 11168 states have internal predecessors, (32409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11169 states to 11169 states and 32409 transitions. [2022-12-14 15:26:24,241 INFO L78 Accepts]: Start accepts. Automaton has 11169 states and 32409 transitions. Word has length 26 [2022-12-14 15:26:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:24,242 INFO L495 AbstractCegarLoop]: Abstraction has 11169 states and 32409 transitions. [2022-12-14 15:26:24,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:24,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11169 states and 32409 transitions. [2022-12-14 15:26:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:24,245 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:24,245 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-12-14 15:26:24,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2022-12-14 15:26:24,246 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:24,246 INFO L85 PathProgramCache]: Analyzing trace with hash -422397908, now seen corresponding path program 12 times [2022-12-14 15:26:24,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:24,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433334414] [2022-12-14 15:26:24,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:24,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:24,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:24,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433334414] [2022-12-14 15:26:24,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433334414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:24,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:24,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:24,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257509321] [2022-12-14 15:26:24,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:24,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:24,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:24,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:24,683 INFO L87 Difference]: Start difference. First operand 11169 states and 32409 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:25,834 INFO L93 Difference]: Finished difference Result 11605 states and 33442 transitions. [2022-12-14 15:26:25,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 15:26:25,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:25,854 INFO L225 Difference]: With dead ends: 11605 [2022-12-14 15:26:25,854 INFO L226 Difference]: Without dead ends: 11605 [2022-12-14 15:26:25,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=437, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:26:25,855 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 149 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:25,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 45 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11605 states. [2022-12-14 15:26:25,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11605 to 11043. [2022-12-14 15:26:25,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11043 states, 10891 states have (on average 2.9480304838857774) internal successors, (32107), 11042 states have internal predecessors, (32107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:26,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11043 states to 11043 states and 32107 transitions. [2022-12-14 15:26:26,015 INFO L78 Accepts]: Start accepts. Automaton has 11043 states and 32107 transitions. Word has length 26 [2022-12-14 15:26:26,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:26,015 INFO L495 AbstractCegarLoop]: Abstraction has 11043 states and 32107 transitions. [2022-12-14 15:26:26,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:26,015 INFO L276 IsEmpty]: Start isEmpty. Operand 11043 states and 32107 transitions. [2022-12-14 15:26:26,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:26,019 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:26,019 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-12-14 15:26:26,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2022-12-14 15:26:26,019 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -119995044, now seen corresponding path program 13 times [2022-12-14 15:26:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:26,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22066322] [2022-12-14 15:26:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:26,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:26,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:26,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22066322] [2022-12-14 15:26:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22066322] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:26,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247634515] [2022-12-14 15:26:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:26,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:26,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:26,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:26,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:26,433 INFO L87 Difference]: Start difference. First operand 11043 states and 32107 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:27,290 INFO L93 Difference]: Finished difference Result 11060 states and 32102 transitions. [2022-12-14 15:26:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:26:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:27,309 INFO L225 Difference]: With dead ends: 11060 [2022-12-14 15:26:27,309 INFO L226 Difference]: Without dead ends: 11060 [2022-12-14 15:26:27,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:26:27,310 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 116 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:27,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 37 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:27,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11060 states. [2022-12-14 15:26:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11060 to 11017. [2022-12-14 15:26:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11017 states, 10865 states have (on average 2.9462494247583986) internal successors, (32011), 11016 states have internal predecessors, (32011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11017 states to 11017 states and 32011 transitions. [2022-12-14 15:26:27,465 INFO L78 Accepts]: Start accepts. Automaton has 11017 states and 32011 transitions. Word has length 26 [2022-12-14 15:26:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:27,465 INFO L495 AbstractCegarLoop]: Abstraction has 11017 states and 32011 transitions. [2022-12-14 15:26:27,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 11017 states and 32011 transitions. [2022-12-14 15:26:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:27,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:27,468 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-12-14 15:26:27,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2022-12-14 15:26:27,469 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:27,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1435804598, now seen corresponding path program 14 times [2022-12-14 15:26:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:27,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587653423] [2022-12-14 15:26:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:27,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:27,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587653423] [2022-12-14 15:26:27,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587653423] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:27,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:27,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:27,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118985421] [2022-12-14 15:26:27,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:27,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 15:26:27,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:27,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 15:26:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-14 15:26:27,992 INFO L87 Difference]: Start difference. First operand 11017 states and 32011 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:29,357 INFO L93 Difference]: Finished difference Result 11393 states and 32895 transitions. [2022-12-14 15:26:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:26:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:29,377 INFO L225 Difference]: With dead ends: 11393 [2022-12-14 15:26:29,378 INFO L226 Difference]: Without dead ends: 11393 [2022-12-14 15:26:29,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:26:29,378 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 175 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:29,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 45 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1142 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 15:26:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11393 states. [2022-12-14 15:26:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11393 to 10897. [2022-12-14 15:26:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10897 states, 10745 states have (on average 2.9514192647743136) internal successors, (31713), 10896 states have internal predecessors, (31713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 31713 transitions. [2022-12-14 15:26:29,577 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 31713 transitions. Word has length 26 [2022-12-14 15:26:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:29,578 INFO L495 AbstractCegarLoop]: Abstraction has 10897 states and 31713 transitions. [2022-12-14 15:26:29,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 31713 transitions. [2022-12-14 15:26:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:29,581 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:29,581 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-12-14 15:26:29,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2022-12-14 15:26:29,581 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1243622096, now seen corresponding path program 10 times [2022-12-14 15:26:29,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:29,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455473405] [2022-12-14 15:26:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:29,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:29,939 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:29,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455473405] [2022-12-14 15:26:29,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455473405] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:29,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:29,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-14 15:26:29,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993359821] [2022-12-14 15:26:29,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:29,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:29,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:29,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:29,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:29,940 INFO L87 Difference]: Start difference. First operand 10897 states and 31713 transitions. Second operand has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:31,055 INFO L93 Difference]: Finished difference Result 13133 states and 37513 transitions. [2022-12-14 15:26:31,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:26:31,055 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:31,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:31,079 INFO L225 Difference]: With dead ends: 13133 [2022-12-14 15:26:31,079 INFO L226 Difference]: Without dead ends: 13133 [2022-12-14 15:26:31,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-12-14 15:26:31,079 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 300 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:31,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 49 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 15:26:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13133 states. [2022-12-14 15:26:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13133 to 10499. [2022-12-14 15:26:31,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10499 states, 10347 states have (on average 2.9482941915531073) internal successors, (30506), 10498 states have internal predecessors, (30506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 30506 transitions. [2022-12-14 15:26:31,245 INFO L78 Accepts]: Start accepts. Automaton has 10499 states and 30506 transitions. Word has length 26 [2022-12-14 15:26:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:31,245 INFO L495 AbstractCegarLoop]: Abstraction has 10499 states and 30506 transitions. [2022-12-14 15:26:31,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:31,246 INFO L276 IsEmpty]: Start isEmpty. Operand 10499 states and 30506 transitions. [2022-12-14 15:26:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:31,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:31,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] [2022-12-14 15:26:31,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2022-12-14 15:26:31,249 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:31,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:31,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1855628039, now seen corresponding path program 6 times [2022-12-14 15:26:31,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:31,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405970945] [2022-12-14 15:26:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:31,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:31,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:31,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405970945] [2022-12-14 15:26:31,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405970945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:31,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:31,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:31,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079198218] [2022-12-14 15:26:31,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:31,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:31,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:31,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:31,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:31,783 INFO L87 Difference]: Start difference. First operand 10499 states and 30506 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:33,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:33,225 INFO L93 Difference]: Finished difference Result 13041 states and 36956 transitions. [2022-12-14 15:26:33,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:26:33,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:33,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:33,249 INFO L225 Difference]: With dead ends: 13041 [2022-12-14 15:26:33,249 INFO L226 Difference]: Without dead ends: 13041 [2022-12-14 15:26:33,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:26:33,250 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 334 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:33,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 61 Invalid, 2362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:26:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13041 states. [2022-12-14 15:26:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13041 to 11075. [2022-12-14 15:26:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11075 states, 10923 states have (on average 2.9333516433214317) internal successors, (32041), 11074 states have internal predecessors, (32041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11075 states to 11075 states and 32041 transitions. [2022-12-14 15:26:33,421 INFO L78 Accepts]: Start accepts. Automaton has 11075 states and 32041 transitions. Word has length 26 [2022-12-14 15:26:33,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:33,421 INFO L495 AbstractCegarLoop]: Abstraction has 11075 states and 32041 transitions. [2022-12-14 15:26:33,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 11075 states and 32041 transitions. [2022-12-14 15:26:33,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:33,425 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:33,425 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-12-14 15:26:33,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2022-12-14 15:26:33,425 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:33,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:33,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1855628121, now seen corresponding path program 6 times [2022-12-14 15:26:33,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:33,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704572007] [2022-12-14 15:26:33,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:33,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:33,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:33,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704572007] [2022-12-14 15:26:33,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704572007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:33,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:33,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86876295] [2022-12-14 15:26:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:33,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:33,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:33,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:33,917 INFO L87 Difference]: Start difference. First operand 11075 states and 32041 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:35,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:35,385 INFO L93 Difference]: Finished difference Result 12761 states and 36181 transitions. [2022-12-14 15:26:35,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:26:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:35,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:35,424 INFO L225 Difference]: With dead ends: 12761 [2022-12-14 15:26:35,425 INFO L226 Difference]: Without dead ends: 12761 [2022-12-14 15:26:35,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:26:35,425 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 339 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:35,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 54 Invalid, 2170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:26:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12761 states. [2022-12-14 15:26:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12761 to 10685. [2022-12-14 15:26:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10685 states, 10533 states have (on average 2.9419918351846577) internal successors, (30988), 10684 states have internal predecessors, (30988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10685 states to 10685 states and 30988 transitions. [2022-12-14 15:26:35,577 INFO L78 Accepts]: Start accepts. Automaton has 10685 states and 30988 transitions. Word has length 26 [2022-12-14 15:26:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:35,577 INFO L495 AbstractCegarLoop]: Abstraction has 10685 states and 30988 transitions. [2022-12-14 15:26:35,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 10685 states and 30988 transitions. [2022-12-14 15:26:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:35,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:35,580 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-12-14 15:26:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2022-12-14 15:26:35,580 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:35,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 469260243, now seen corresponding path program 10 times [2022-12-14 15:26:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:35,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404136706] [2022-12-14 15:26:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:35,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:36,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:36,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404136706] [2022-12-14 15:26:36,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404136706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:36,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:36,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923524397] [2022-12-14 15:26:36,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:36,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:36,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:36,041 INFO L87 Difference]: Start difference. First operand 10685 states and 30988 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:37,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:37,130 INFO L93 Difference]: Finished difference Result 10817 states and 31251 transitions. [2022-12-14 15:26:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:26:37,130 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:37,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:37,149 INFO L225 Difference]: With dead ends: 10817 [2022-12-14 15:26:37,149 INFO L226 Difference]: Without dead ends: 10817 [2022-12-14 15:26:37,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-12-14 15:26:37,149 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:37,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 38 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:26:37,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10817 states. [2022-12-14 15:26:37,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10817 to 10706. [2022-12-14 15:26:37,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10706 states, 10554 states have (on average 2.9410649990524917) internal successors, (31040), 10705 states have internal predecessors, (31040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10706 states to 10706 states and 31040 transitions. [2022-12-14 15:26:37,304 INFO L78 Accepts]: Start accepts. Automaton has 10706 states and 31040 transitions. Word has length 26 [2022-12-14 15:26:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:37,304 INFO L495 AbstractCegarLoop]: Abstraction has 10706 states and 31040 transitions. [2022-12-14 15:26:37,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10706 states and 31040 transitions. [2022-12-14 15:26:37,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:37,308 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:37,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:26:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2022-12-14 15:26:37,308 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:37,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1277679037, now seen corresponding path program 11 times [2022-12-14 15:26:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:37,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948739000] [2022-12-14 15:26:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:38,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:38,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948739000] [2022-12-14 15:26:38,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948739000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:38,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:38,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082198735] [2022-12-14 15:26:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:38,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:38,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:38,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:38,191 INFO L87 Difference]: Start difference. First operand 10706 states and 31040 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:39,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:39,541 INFO L93 Difference]: Finished difference Result 10842 states and 31271 transitions. [2022-12-14 15:26:39,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 15:26:39,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:39,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:39,559 INFO L225 Difference]: With dead ends: 10842 [2022-12-14 15:26:39,559 INFO L226 Difference]: Without dead ends: 10842 [2022-12-14 15:26:39,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=378, Unknown=0, NotChecked=0, Total=552 [2022-12-14 15:26:39,560 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 222 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:39,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 38 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:26:39,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2022-12-14 15:26:39,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10521. [2022-12-14 15:26:39,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10521 states, 10369 states have (on average 2.9477288070209275) internal successors, (30565), 10520 states have internal predecessors, (30565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10521 states to 10521 states and 30565 transitions. [2022-12-14 15:26:39,706 INFO L78 Accepts]: Start accepts. Automaton has 10521 states and 30565 transitions. Word has length 26 [2022-12-14 15:26:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:39,706 INFO L495 AbstractCegarLoop]: Abstraction has 10521 states and 30565 transitions. [2022-12-14 15:26:39,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand 10521 states and 30565 transitions. [2022-12-14 15:26:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:39,709 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:39,709 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-12-14 15:26:39,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2022-12-14 15:26:39,709 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:39,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1467914763, now seen corresponding path program 12 times [2022-12-14 15:26:39,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:39,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827976735] [2022-12-14 15:26:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:39,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:40,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:40,158 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827976735] [2022-12-14 15:26:40,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827976735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:40,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:40,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290062516] [2022-12-14 15:26:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:40,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:40,159 INFO L87 Difference]: Start difference. First operand 10521 states and 30565 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:40,838 INFO L93 Difference]: Finished difference Result 10738 states and 31026 transitions. [2022-12-14 15:26:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:26:40,838 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:40,856 INFO L225 Difference]: With dead ends: 10738 [2022-12-14 15:26:40,856 INFO L226 Difference]: Without dead ends: 10738 [2022-12-14 15:26:40,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2022-12-14 15:26:40,857 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 100 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:40,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 25 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 15:26:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2022-12-14 15:26:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10467. [2022-12-14 15:26:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10467 states, 10315 states have (on average 2.948230731943771) internal successors, (30411), 10466 states have internal predecessors, (30411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10467 states to 10467 states and 30411 transitions. [2022-12-14 15:26:41,021 INFO L78 Accepts]: Start accepts. Automaton has 10467 states and 30411 transitions. Word has length 26 [2022-12-14 15:26:41,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:41,021 INFO L495 AbstractCegarLoop]: Abstraction has 10467 states and 30411 transitions. [2022-12-14 15:26:41,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 10467 states and 30411 transitions. [2022-12-14 15:26:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:41,024 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:41,024 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-12-14 15:26:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2022-12-14 15:26:41,024 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:41,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash 588657937, now seen corresponding path program 7 times [2022-12-14 15:26:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:41,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114287565] [2022-12-14 15:26:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:41,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114287565] [2022-12-14 15:26:41,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114287565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:41,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:41,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:41,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880690742] [2022-12-14 15:26:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:41,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:41,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:41,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:41,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:41,565 INFO L87 Difference]: Start difference. First operand 10467 states and 30411 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:43,307 INFO L93 Difference]: Finished difference Result 12679 states and 36043 transitions. [2022-12-14 15:26:43,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:26:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:43,330 INFO L225 Difference]: With dead ends: 12679 [2022-12-14 15:26:43,330 INFO L226 Difference]: Without dead ends: 12679 [2022-12-14 15:26:43,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:26:43,331 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 262 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:43,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 73 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 15:26:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12679 states. [2022-12-14 15:26:43,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12679 to 10923. [2022-12-14 15:26:43,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10923 states, 10771 states have (on average 2.9364033051712934) internal successors, (31628), 10922 states have internal predecessors, (31628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10923 states to 10923 states and 31628 transitions. [2022-12-14 15:26:43,501 INFO L78 Accepts]: Start accepts. Automaton has 10923 states and 31628 transitions. Word has length 26 [2022-12-14 15:26:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:43,502 INFO L495 AbstractCegarLoop]: Abstraction has 10923 states and 31628 transitions. [2022-12-14 15:26:43,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10923 states and 31628 transitions. [2022-12-14 15:26:43,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:43,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:43,505 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-12-14 15:26:43,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2022-12-14 15:26:43,505 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 588658019, now seen corresponding path program 7 times [2022-12-14 15:26:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187810184] [2022-12-14 15:26:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:43,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:43,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:43,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187810184] [2022-12-14 15:26:43,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187810184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:43,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:43,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081710414] [2022-12-14 15:26:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:43,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:43,989 INFO L87 Difference]: Start difference. First operand 10923 states and 31628 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:45,517 INFO L93 Difference]: Finished difference Result 12413 states and 35306 transitions. [2022-12-14 15:26:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:26:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:45,541 INFO L225 Difference]: With dead ends: 12413 [2022-12-14 15:26:45,541 INFO L226 Difference]: Without dead ends: 12413 [2022-12-14 15:26:45,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=638, Unknown=0, NotChecked=0, Total=812 [2022-12-14 15:26:45,541 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 328 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2258 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 2273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:45,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 62 Invalid, 2273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2258 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:26:45,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12413 states. [2022-12-14 15:26:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12413 to 10533. [2022-12-14 15:26:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10533 states, 10381 states have (on average 2.9452846546575473) internal successors, (30575), 10532 states have internal predecessors, (30575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:45,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10533 states to 10533 states and 30575 transitions. [2022-12-14 15:26:45,704 INFO L78 Accepts]: Start accepts. Automaton has 10533 states and 30575 transitions. Word has length 26 [2022-12-14 15:26:45,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:45,704 INFO L495 AbstractCegarLoop]: Abstraction has 10533 states and 30575 transitions. [2022-12-14 15:26:45,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:45,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10533 states and 30575 transitions. [2022-12-14 15:26:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:45,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:45,707 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-12-14 15:26:45,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2022-12-14 15:26:45,707 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:45,708 INFO L85 PathProgramCache]: Analyzing trace with hash -797709859, now seen corresponding path program 13 times [2022-12-14 15:26:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:45,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886121532] [2022-12-14 15:26:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:46,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886121532] [2022-12-14 15:26:46,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886121532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:46,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:46,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:46,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860625662] [2022-12-14 15:26:46,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:46,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:46,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:46,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:46,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:46,143 INFO L87 Difference]: Start difference. First operand 10533 states and 30575 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:46,854 INFO L93 Difference]: Finished difference Result 10561 states and 30628 transitions. [2022-12-14 15:26:46,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:26:46,855 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:46,873 INFO L225 Difference]: With dead ends: 10561 [2022-12-14 15:26:46,873 INFO L226 Difference]: Without dead ends: 10561 [2022-12-14 15:26:46,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:26:46,874 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 108 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:46,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 33 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:26:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10561 states. [2022-12-14 15:26:46,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 10545. [2022-12-14 15:26:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10545 states, 10393 states have (on average 2.944578081400943) internal successors, (30603), 10544 states have internal predecessors, (30603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10545 states to 10545 states and 30603 transitions. [2022-12-14 15:26:47,022 INFO L78 Accepts]: Start accepts. Automaton has 10545 states and 30603 transitions. Word has length 26 [2022-12-14 15:26:47,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:47,022 INFO L495 AbstractCegarLoop]: Abstraction has 10545 states and 30603 transitions. [2022-12-14 15:26:47,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 10545 states and 30603 transitions. [2022-12-14 15:26:47,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:47,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:47,025 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-12-14 15:26:47,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2022-12-14 15:26:47,025 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:47,025 INFO L85 PathProgramCache]: Analyzing trace with hash 10708935, now seen corresponding path program 14 times [2022-12-14 15:26:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:47,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902760234] [2022-12-14 15:26:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:47,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902760234] [2022-12-14 15:26:47,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902760234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:47,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:47,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666907943] [2022-12-14 15:26:47,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:47,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:47,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:47,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:47,719 INFO L87 Difference]: Start difference. First operand 10545 states and 30603 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:49,347 INFO L93 Difference]: Finished difference Result 10718 states and 30994 transitions. [2022-12-14 15:26:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:26:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:49,366 INFO L225 Difference]: With dead ends: 10718 [2022-12-14 15:26:49,366 INFO L226 Difference]: Without dead ends: 10718 [2022-12-14 15:26:49,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2022-12-14 15:26:49,367 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 130 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:49,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 35 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:26:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10718 states. [2022-12-14 15:26:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10718 to 10473. [2022-12-14 15:26:49,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10473 states, 10321 states have (on average 2.94855149694797) internal successors, (30432), 10472 states have internal predecessors, (30432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10473 states to 10473 states and 30432 transitions. [2022-12-14 15:26:49,518 INFO L78 Accepts]: Start accepts. Automaton has 10473 states and 30432 transitions. Word has length 26 [2022-12-14 15:26:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:49,518 INFO L495 AbstractCegarLoop]: Abstraction has 10473 states and 30432 transitions. [2022-12-14 15:26:49,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 10473 states and 30432 transitions. [2022-12-14 15:26:49,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:49,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:49,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:26:49,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2022-12-14 15:26:49,522 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:49,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:49,522 INFO L85 PathProgramCache]: Analyzing trace with hash 824424309, now seen corresponding path program 15 times [2022-12-14 15:26:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:49,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767327821] [2022-12-14 15:26:49,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:49,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:50,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:50,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767327821] [2022-12-14 15:26:50,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767327821] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:50,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:50,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:50,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544174239] [2022-12-14 15:26:50,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:50,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:50,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:50,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:50,043 INFO L87 Difference]: Start difference. First operand 10473 states and 30432 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:50,883 INFO L93 Difference]: Finished difference Result 10488 states and 30424 transitions. [2022-12-14 15:26:50,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:26:50,884 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:50,901 INFO L225 Difference]: With dead ends: 10488 [2022-12-14 15:26:50,902 INFO L226 Difference]: Without dead ends: 10488 [2022-12-14 15:26:50,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-12-14 15:26:50,902 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 113 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:50,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 44 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 15:26:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10488 states. [2022-12-14 15:26:51,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10488 to 10447. [2022-12-14 15:26:51,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10447 states, 10295 states have (on average 2.9467702768334143) internal successors, (30337), 10446 states have internal predecessors, (30337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 30337 transitions. [2022-12-14 15:26:51,048 INFO L78 Accepts]: Start accepts. Automaton has 10447 states and 30337 transitions. Word has length 26 [2022-12-14 15:26:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:51,048 INFO L495 AbstractCegarLoop]: Abstraction has 10447 states and 30337 transitions. [2022-12-14 15:26:51,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 10447 states and 30337 transitions. [2022-12-14 15:26:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:51,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:51,051 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-12-14 15:26:51,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2022-12-14 15:26:51,051 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:51,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1114738769, now seen corresponding path program 16 times [2022-12-14 15:26:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:51,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048387850] [2022-12-14 15:26:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:51,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:51,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:51,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048387850] [2022-12-14 15:26:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048387850] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:51,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-12-14 15:26:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972575843] [2022-12-14 15:26:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:51,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 15:26:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:51,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 15:26:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:26:51,523 INFO L87 Difference]: Start difference. First operand 10447 states and 30337 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:53,063 INFO L93 Difference]: Finished difference Result 10655 states and 30677 transitions. [2022-12-14 15:26:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:26:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:53,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:53,081 INFO L225 Difference]: With dead ends: 10655 [2022-12-14 15:26:53,081 INFO L226 Difference]: Without dead ends: 10655 [2022-12-14 15:26:53,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:26:53,082 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 159 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:53,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 62 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 15:26:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10655 states. [2022-12-14 15:26:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10655 to 10161. [2022-12-14 15:26:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10161 states, 10009 states have (on average 2.9471475671895293) internal successors, (29498), 10160 states have internal predecessors, (29498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:53,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10161 states to 10161 states and 29498 transitions. [2022-12-14 15:26:53,224 INFO L78 Accepts]: Start accepts. Automaton has 10161 states and 29498 transitions. Word has length 26 [2022-12-14 15:26:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:53,224 INFO L495 AbstractCegarLoop]: Abstraction has 10161 states and 29498 transitions. [2022-12-14 15:26:53,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 10161 states and 29498 transitions. [2022-12-14 15:26:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:53,227 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:53,227 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-12-14 15:26:53,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2022-12-14 15:26:53,227 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:53,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:53,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1518445335, now seen corresponding path program 8 times [2022-12-14 15:26:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:53,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304267394] [2022-12-14 15:26:53,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:53,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:53,679 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:53,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304267394] [2022-12-14 15:26:53,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304267394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:53,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:53,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373883474] [2022-12-14 15:26:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:53,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:53,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:53,681 INFO L87 Difference]: Start difference. First operand 10161 states and 29498 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:55,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:55,545 INFO L93 Difference]: Finished difference Result 12760 states and 36079 transitions. [2022-12-14 15:26:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 15:26:55,546 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:55,568 INFO L225 Difference]: With dead ends: 12760 [2022-12-14 15:26:55,569 INFO L226 Difference]: Without dead ends: 12760 [2022-12-14 15:26:55,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=294, Invalid=1112, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 15:26:55,569 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 301 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:55,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 81 Invalid, 3044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:26:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12760 states. [2022-12-14 15:26:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12760 to 10379. [2022-12-14 15:26:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10379 states, 10227 states have (on average 2.9401584042241127) internal successors, (30069), 10378 states have internal predecessors, (30069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 30069 transitions. [2022-12-14 15:26:55,734 INFO L78 Accepts]: Start accepts. Automaton has 10379 states and 30069 transitions. Word has length 26 [2022-12-14 15:26:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 10379 states and 30069 transitions. [2022-12-14 15:26:55,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:55,734 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 30069 transitions. [2022-12-14 15:26:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 15:26:55,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:55,737 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-12-14 15:26:55,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2022-12-14 15:26:55,737 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:55,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:55,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1518445417, now seen corresponding path program 8 times [2022-12-14 15:26:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:55,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015834019] [2022-12-14 15:26:55,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:55,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:56,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:56,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015834019] [2022-12-14 15:26:56,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015834019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:56,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:56,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140954668] [2022-12-14 15:26:56,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:56,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:56,200 INFO L87 Difference]: Start difference. First operand 10379 states and 30069 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:58,162 INFO L93 Difference]: Finished difference Result 12494 states and 35342 transitions. [2022-12-14 15:26:58,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 15:26:58,163 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 15:26:58,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:58,185 INFO L225 Difference]: With dead ends: 12494 [2022-12-14 15:26:58,185 INFO L226 Difference]: Without dead ends: 12494 [2022-12-14 15:26:58,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1044, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 15:26:58,185 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 387 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:58,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 71 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 15:26:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12494 states. [2022-12-14 15:26:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12494 to 9923. [2022-12-14 15:26:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9923 states, 9771 states have (on average 2.9538430048101523) internal successors, (28862), 9922 states have internal predecessors, (28862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:58,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9923 states to 9923 states and 28862 transitions. [2022-12-14 15:26:58,342 INFO L78 Accepts]: Start accepts. Automaton has 9923 states and 28862 transitions. Word has length 26 [2022-12-14 15:26:58,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:58,342 INFO L495 AbstractCegarLoop]: Abstraction has 9923 states and 28862 transitions. [2022-12-14 15:26:58,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:26:58,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9923 states and 28862 transitions. [2022-12-14 15:26:58,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:26:58,345 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:58,345 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-12-14 15:26:58,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2022-12-14 15:26:58,345 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:26:58,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash 211885778, now seen corresponding path program 1 times [2022-12-14 15:26:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:58,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813261621] [2022-12-14 15:26:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:59,467 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:59,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813261621] [2022-12-14 15:26:59,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813261621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:26:59,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:26:59,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:26:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497345251] [2022-12-14 15:26:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:26:59,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:26:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:26:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:26:59,468 INFO L87 Difference]: Start difference. First operand 9923 states and 28862 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:01,283 INFO L93 Difference]: Finished difference Result 14637 states and 42359 transitions. [2022-12-14 15:27:01,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:27:01,284 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:01,311 INFO L225 Difference]: With dead ends: 14637 [2022-12-14 15:27:01,311 INFO L226 Difference]: Without dead ends: 14637 [2022-12-14 15:27:01,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:27:01,312 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 240 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:01,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 15 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:27:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14637 states. [2022-12-14 15:27:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14637 to 10225. [2022-12-14 15:27:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10225 states, 10073 states have (on average 2.9558224957808004) internal successors, (29774), 10224 states have internal predecessors, (29774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10225 states to 10225 states and 29774 transitions. [2022-12-14 15:27:01,480 INFO L78 Accepts]: Start accepts. Automaton has 10225 states and 29774 transitions. Word has length 28 [2022-12-14 15:27:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:01,480 INFO L495 AbstractCegarLoop]: Abstraction has 10225 states and 29774 transitions. [2022-12-14 15:27:01,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:01,480 INFO L276 IsEmpty]: Start isEmpty. Operand 10225 states and 29774 transitions. [2022-12-14 15:27:01,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:01,483 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:01,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:27:01,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2022-12-14 15:27:01,483 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash 20798299, now seen corresponding path program 1 times [2022-12-14 15:27:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:01,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476332452] [2022-12-14 15:27:01,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:01,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:02,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:02,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:02,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476332452] [2022-12-14 15:27:02,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476332452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:02,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:02,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:27:02,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204349844] [2022-12-14 15:27:02,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:02,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:27:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:27:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:27:02,369 INFO L87 Difference]: Start difference. First operand 10225 states and 29774 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:03,998 INFO L93 Difference]: Finished difference Result 10551 states and 30663 transitions. [2022-12-14 15:27:03,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:27:03,999 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:04,017 INFO L225 Difference]: With dead ends: 10551 [2022-12-14 15:27:04,017 INFO L226 Difference]: Without dead ends: 10551 [2022-12-14 15:27:04,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:27:04,018 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 199 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:04,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 14 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 15:27:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10551 states. [2022-12-14 15:27:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10551 to 10470. [2022-12-14 15:27:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10470 states, 10318 states have (on average 2.951250242295018) internal successors, (30451), 10469 states have internal predecessors, (30451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10470 states to 10470 states and 30451 transitions. [2022-12-14 15:27:04,176 INFO L78 Accepts]: Start accepts. Automaton has 10470 states and 30451 transitions. Word has length 28 [2022-12-14 15:27:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:04,176 INFO L495 AbstractCegarLoop]: Abstraction has 10470 states and 30451 transitions. [2022-12-14 15:27:04,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:04,176 INFO L276 IsEmpty]: Start isEmpty. Operand 10470 states and 30451 transitions. [2022-12-14 15:27:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:04,179 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:04,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:27:04,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2022-12-14 15:27:04,179 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash -393076820, now seen corresponding path program 2 times [2022-12-14 15:27:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:04,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634593058] [2022-12-14 15:27:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:05,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-12-14 15:27:05,166 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:05,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634593058] [2022-12-14 15:27:05,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634593058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:05,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:05,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:27:05,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240527014] [2022-12-14 15:27:05,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:05,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:27:05,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:05,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:27:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:27:05,167 INFO L87 Difference]: Start difference. First operand 10470 states and 30451 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:07,098 INFO L93 Difference]: Finished difference Result 15736 states and 45440 transitions. [2022-12-14 15:27:07,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:27:07,099 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:07,128 INFO L225 Difference]: With dead ends: 15736 [2022-12-14 15:27:07,128 INFO L226 Difference]: Without dead ends: 15736 [2022-12-14 15:27:07,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:27:07,128 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 217 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:07,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 28 Invalid, 2494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:27:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15736 states. [2022-12-14 15:27:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15736 to 10497. [2022-12-14 15:27:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10497 states, 10345 states have (on average 2.9515708071532143) internal successors, (30534), 10496 states have internal predecessors, (30534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10497 states to 10497 states and 30534 transitions. [2022-12-14 15:27:07,306 INFO L78 Accepts]: Start accepts. Automaton has 10497 states and 30534 transitions. Word has length 28 [2022-12-14 15:27:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:07,306 INFO L495 AbstractCegarLoop]: Abstraction has 10497 states and 30534 transitions. [2022-12-14 15:27:07,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 10497 states and 30534 transitions. [2022-12-14 15:27:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:07,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:07,309 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-12-14 15:27:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2022-12-14 15:27:07,310 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1855920862, now seen corresponding path program 3 times [2022-12-14 15:27:07,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:07,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496417246] [2022-12-14 15:27:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:08,208 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:08,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496417246] [2022-12-14 15:27:08,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496417246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:08,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:08,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:27:08,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351669113] [2022-12-14 15:27:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:08,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:27:08,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:08,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:27:08,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:27:08,209 INFO L87 Difference]: Start difference. First operand 10497 states and 30534 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:10,072 INFO L93 Difference]: Finished difference Result 11356 states and 32870 transitions. [2022-12-14 15:27:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:27:10,073 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:10,092 INFO L225 Difference]: With dead ends: 11356 [2022-12-14 15:27:10,093 INFO L226 Difference]: Without dead ends: 11356 [2022-12-14 15:27:10,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:27:10,093 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 238 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:10,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 51 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2039 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 15:27:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11356 states. [2022-12-14 15:27:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11356 to 10940. [2022-12-14 15:27:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10940 states, 10788 states have (on average 2.9398405635891733) internal successors, (31715), 10939 states have internal predecessors, (31715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10940 states to 10940 states and 31715 transitions. [2022-12-14 15:27:10,253 INFO L78 Accepts]: Start accepts. Automaton has 10940 states and 31715 transitions. Word has length 28 [2022-12-14 15:27:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:10,253 INFO L495 AbstractCegarLoop]: Abstraction has 10940 states and 31715 transitions. [2022-12-14 15:27:10,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 10940 states and 31715 transitions. [2022-12-14 15:27:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:10,258 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:10,258 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-12-14 15:27:10,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2022-12-14 15:27:10,258 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:10,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:10,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1565807125, now seen corresponding path program 2 times [2022-12-14 15:27:10,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:10,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313823154] [2022-12-14 15:27:10,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:10,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:11,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:11,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313823154] [2022-12-14 15:27:11,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313823154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:11,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:11,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:27:11,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583958981] [2022-12-14 15:27:11,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:11,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:27:11,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:11,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:27:11,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:27:11,373 INFO L87 Difference]: Start difference. First operand 10940 states and 31715 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:14,020 INFO L93 Difference]: Finished difference Result 16163 states and 46461 transitions. [2022-12-14 15:27:14,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:27:14,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:14,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:14,049 INFO L225 Difference]: With dead ends: 16163 [2022-12-14 15:27:14,049 INFO L226 Difference]: Without dead ends: 16163 [2022-12-14 15:27:14,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=191, Invalid=801, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:27:14,050 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 278 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:14,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 24 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:27:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16163 states. [2022-12-14 15:27:14,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16163 to 10958. [2022-12-14 15:27:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10958 states, 10806 states have (on average 2.9401258560059227) internal successors, (31771), 10957 states have internal predecessors, (31771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10958 states to 10958 states and 31771 transitions. [2022-12-14 15:27:14,249 INFO L78 Accepts]: Start accepts. Automaton has 10958 states and 31771 transitions. Word has length 28 [2022-12-14 15:27:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:14,249 INFO L495 AbstractCegarLoop]: Abstraction has 10958 states and 31771 transitions. [2022-12-14 15:27:14,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 10958 states and 31771 transitions. [2022-12-14 15:27:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:14,253 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:14,253 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-12-14 15:27:14,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2022-12-14 15:27:14,254 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:14,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 269673403, now seen corresponding path program 3 times [2022-12-14 15:27:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:14,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710682739] [2022-12-14 15:27:14,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:14,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:15,647 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:15,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710682739] [2022-12-14 15:27:15,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710682739] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:15,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:15,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:27:15,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902242031] [2022-12-14 15:27:15,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:15,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:27:15,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:15,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:27:15,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:27:15,649 INFO L87 Difference]: Start difference. First operand 10958 states and 31771 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:18,341 INFO L93 Difference]: Finished difference Result 16094 states and 46258 transitions. [2022-12-14 15:27:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:27:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:18,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:18,372 INFO L225 Difference]: With dead ends: 16094 [2022-12-14 15:27:18,372 INFO L226 Difference]: Without dead ends: 16094 [2022-12-14 15:27:18,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=853, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:27:18,373 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 311 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 2066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:18,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 36 Invalid, 2066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:27:18,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2022-12-14 15:27:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 11078. [2022-12-14 15:27:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11078 states, 10926 states have (on average 2.9360241625480503) internal successors, (32079), 11077 states have internal predecessors, (32079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11078 states to 11078 states and 32079 transitions. [2022-12-14 15:27:18,563 INFO L78 Accepts]: Start accepts. Automaton has 11078 states and 32079 transitions. Word has length 28 [2022-12-14 15:27:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:18,563 INFO L495 AbstractCegarLoop]: Abstraction has 11078 states and 32079 transitions. [2022-12-14 15:27:18,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 11078 states and 32079 transitions. [2022-12-14 15:27:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:18,567 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:18,567 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-12-14 15:27:18,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2022-12-14 15:27:18,568 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:18,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:18,568 INFO L85 PathProgramCache]: Analyzing trace with hash -228946139, now seen corresponding path program 4 times [2022-12-14 15:27:18,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253513705] [2022-12-14 15:27:18,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:18,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:19,786 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:19,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253513705] [2022-12-14 15:27:19,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253513705] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:19,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:19,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:27:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027639799] [2022-12-14 15:27:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:19,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:27:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:27:19,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:27:19,787 INFO L87 Difference]: Start difference. First operand 11078 states and 32079 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:22,196 INFO L93 Difference]: Finished difference Result 16699 states and 47843 transitions. [2022-12-14 15:27:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 15:27:22,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:22,226 INFO L225 Difference]: With dead ends: 16699 [2022-12-14 15:27:22,226 INFO L226 Difference]: Without dead ends: 16699 [2022-12-14 15:27:22,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=243, Invalid=1089, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 15:27:22,226 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 359 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2772 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:22,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 61 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2772 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:27:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16699 states. [2022-12-14 15:27:22,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16699 to 11362. [2022-12-14 15:27:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11362 states, 11210 states have (on average 2.922836752899197) internal successors, (32765), 11361 states have internal predecessors, (32765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:22,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11362 states to 11362 states and 32765 transitions. [2022-12-14 15:27:22,412 INFO L78 Accepts]: Start accepts. Automaton has 11362 states and 32765 transitions. Word has length 28 [2022-12-14 15:27:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:22,412 INFO L495 AbstractCegarLoop]: Abstraction has 11362 states and 32765 transitions. [2022-12-14 15:27:22,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 11362 states and 32765 transitions. [2022-12-14 15:27:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:22,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:22,417 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-12-14 15:27:22,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2022-12-14 15:27:22,417 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1165820537, now seen corresponding path program 5 times [2022-12-14 15:27:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241265335] [2022-12-14 15:27:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:22,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:23,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:23,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:23,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241265335] [2022-12-14 15:27:23,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241265335] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:23,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:23,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:27:23,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087069408] [2022-12-14 15:27:23,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:23,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:27:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:27:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:27:23,329 INFO L87 Difference]: Start difference. First operand 11362 states and 32765 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:25,548 INFO L93 Difference]: Finished difference Result 16466 states and 47123 transitions. [2022-12-14 15:27:25,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:27:25,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:25,580 INFO L225 Difference]: With dead ends: 16466 [2022-12-14 15:27:25,580 INFO L226 Difference]: Without dead ends: 16466 [2022-12-14 15:27:25,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:27:25,581 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 242 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:25,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 41 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 15:27:25,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16466 states. [2022-12-14 15:27:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16466 to 11363. [2022-12-14 15:27:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11363 states, 11211 states have (on average 2.923022031932923) internal successors, (32770), 11362 states have internal predecessors, (32770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11363 states to 11363 states and 32770 transitions. [2022-12-14 15:27:25,777 INFO L78 Accepts]: Start accepts. Automaton has 11363 states and 32770 transitions. Word has length 28 [2022-12-14 15:27:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:25,777 INFO L495 AbstractCegarLoop]: Abstraction has 11363 states and 32770 transitions. [2022-12-14 15:27:25,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 11363 states and 32770 transitions. [2022-12-14 15:27:25,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:25,782 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:25,782 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-12-14 15:27:25,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2022-12-14 15:27:25,782 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -130313185, now seen corresponding path program 6 times [2022-12-14 15:27:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636410746] [2022-12-14 15:27:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:26,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:26,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:26,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636410746] [2022-12-14 15:27:26,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636410746] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:26,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:26,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:27:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920389598] [2022-12-14 15:27:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:27:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:27:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:27:26,709 INFO L87 Difference]: Start difference. First operand 11363 states and 32770 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:28,771 INFO L93 Difference]: Finished difference Result 16938 states and 48320 transitions. [2022-12-14 15:27:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:27:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:28,803 INFO L225 Difference]: With dead ends: 16938 [2022-12-14 15:27:28,803 INFO L226 Difference]: Without dead ends: 16938 [2022-12-14 15:27:28,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 15:27:28,803 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 289 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 2291 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:28,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 51 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:27:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16938 states. [2022-12-14 15:27:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16938 to 11483. [2022-12-14 15:27:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11483 states, 11331 states have (on average 2.9192480804871592) internal successors, (33078), 11482 states have internal predecessors, (33078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11483 states to 11483 states and 33078 transitions. [2022-12-14 15:27:29,001 INFO L78 Accepts]: Start accepts. Automaton has 11483 states and 33078 transitions. Word has length 28 [2022-12-14 15:27:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:29,001 INFO L495 AbstractCegarLoop]: Abstraction has 11483 states and 33078 transitions. [2022-12-14 15:27:29,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 11483 states and 33078 transitions. [2022-12-14 15:27:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:29,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:29,005 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-12-14 15:27:29,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2022-12-14 15:27:29,006 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -628932727, now seen corresponding path program 7 times [2022-12-14 15:27:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049918725] [2022-12-14 15:27:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:29,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:30,026 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:30,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049918725] [2022-12-14 15:27:30,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049918725] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:30,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:30,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:27:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078496954] [2022-12-14 15:27:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:30,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:27:30,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:30,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:27:30,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:27:30,027 INFO L87 Difference]: Start difference. First operand 11483 states and 33078 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:32,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:32,656 INFO L93 Difference]: Finished difference Result 17130 states and 48776 transitions. [2022-12-14 15:27:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:27:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:32,688 INFO L225 Difference]: With dead ends: 17130 [2022-12-14 15:27:32,688 INFO L226 Difference]: Without dead ends: 17130 [2022-12-14 15:27:32,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=799, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:27:32,689 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 350 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:32,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 85 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 15:27:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17130 states. [2022-12-14 15:27:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17130 to 11342. [2022-12-14 15:27:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11342 states, 11190 states have (on average 2.922520107238606) internal successors, (32703), 11341 states have internal predecessors, (32703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:32,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11342 states to 11342 states and 32703 transitions. [2022-12-14 15:27:32,886 INFO L78 Accepts]: Start accepts. Automaton has 11342 states and 32703 transitions. Word has length 28 [2022-12-14 15:27:32,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:32,887 INFO L495 AbstractCegarLoop]: Abstraction has 11342 states and 32703 transitions. [2022-12-14 15:27:32,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:32,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11342 states and 32703 transitions. [2022-12-14 15:27:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:32,891 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:32,891 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-12-14 15:27:32,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2022-12-14 15:27:32,892 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash 566795848, now seen corresponding path program 4 times [2022-12-14 15:27:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:32,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745586299] [2022-12-14 15:27:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:32,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:33,855 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:33,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745586299] [2022-12-14 15:27:33,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745586299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:33,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:33,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:27:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667197747] [2022-12-14 15:27:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:33,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:27:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:27:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:27:33,856 INFO L87 Difference]: Start difference. First operand 11342 states and 32703 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:35,963 INFO L93 Difference]: Finished difference Result 16428 states and 47076 transitions. [2022-12-14 15:27:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:27:35,963 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:35,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:35,994 INFO L225 Difference]: With dead ends: 16428 [2022-12-14 15:27:35,994 INFO L226 Difference]: Without dead ends: 16428 [2022-12-14 15:27:35,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-12-14 15:27:35,994 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 295 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:35,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 38 Invalid, 2327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-12-14 15:27:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16428 states. [2022-12-14 15:27:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16428 to 11340. [2022-12-14 15:27:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11340 states, 11188 states have (on average 2.9225956381837683) internal successors, (32698), 11339 states have internal predecessors, (32698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11340 states to 11340 states and 32698 transitions. [2022-12-14 15:27:36,189 INFO L78 Accepts]: Start accepts. Automaton has 11340 states and 32698 transitions. Word has length 28 [2022-12-14 15:27:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:36,189 INFO L495 AbstractCegarLoop]: Abstraction has 11340 states and 32698 transitions. [2022-12-14 15:27:36,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 11340 states and 32698 transitions. [2022-12-14 15:27:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:36,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:36,194 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-12-14 15:27:36,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2022-12-14 15:27:36,194 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1479173766, now seen corresponding path program 5 times [2022-12-14 15:27:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:36,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858917805] [2022-12-14 15:27:36,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:36,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:37,322 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:37,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858917805] [2022-12-14 15:27:37,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858917805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:37,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:37,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:27:37,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593621430] [2022-12-14 15:27:37,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:37,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:27:37,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:37,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:27:37,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:27:37,323 INFO L87 Difference]: Start difference. First operand 11340 states and 32698 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:39,624 INFO L93 Difference]: Finished difference Result 17144 states and 49086 transitions. [2022-12-14 15:27:39,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 15:27:39,624 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:39,655 INFO L225 Difference]: With dead ends: 17144 [2022-12-14 15:27:39,655 INFO L226 Difference]: Without dead ends: 17144 [2022-12-14 15:27:39,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:27:39,655 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 298 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 2551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:39,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 72 Invalid, 2551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:27:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17144 states. [2022-12-14 15:27:39,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17144 to 11312. [2022-12-14 15:27:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11312 states, 11160 states have (on average 2.9221326164874553) internal successors, (32611), 11311 states have internal predecessors, (32611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11312 states to 11312 states and 32611 transitions. [2022-12-14 15:27:39,885 INFO L78 Accepts]: Start accepts. Automaton has 11312 states and 32611 transitions. Word has length 28 [2022-12-14 15:27:39,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:39,886 INFO L495 AbstractCegarLoop]: Abstraction has 11312 states and 32611 transitions. [2022-12-14 15:27:39,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:39,886 INFO L276 IsEmpty]: Start isEmpty. Operand 11312 states and 32611 transitions. [2022-12-14 15:27:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:39,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:39,889 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-12-14 15:27:39,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2022-12-14 15:27:39,889 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:39,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:39,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1383828430, now seen corresponding path program 6 times [2022-12-14 15:27:39,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:39,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311016409] [2022-12-14 15:27:39,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:41,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:41,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311016409] [2022-12-14 15:27:41,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311016409] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:41,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:41,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:27:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483143049] [2022-12-14 15:27:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:41,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:27:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:41,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:27:41,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:27:41,368 INFO L87 Difference]: Start difference. First operand 11312 states and 32611 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:44,169 INFO L93 Difference]: Finished difference Result 16268 states and 46692 transitions. [2022-12-14 15:27:44,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:27:44,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:44,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:44,198 INFO L225 Difference]: With dead ends: 16268 [2022-12-14 15:27:44,198 INFO L226 Difference]: Without dead ends: 16268 [2022-12-14 15:27:44,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:27:44,198 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 316 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:44,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 65 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-12-14 15:27:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16268 states. [2022-12-14 15:27:44,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16268 to 11372. [2022-12-14 15:27:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11372 states, 11220 states have (on average 2.9193404634581106) internal successors, (32755), 11371 states have internal predecessors, (32755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:44,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 32755 transitions. [2022-12-14 15:27:44,388 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 32755 transitions. Word has length 28 [2022-12-14 15:27:44,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:44,388 INFO L495 AbstractCegarLoop]: Abstraction has 11372 states and 32755 transitions. [2022-12-14 15:27:44,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 32755 transitions. [2022-12-14 15:27:44,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:44,393 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:44,393 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-12-14 15:27:44,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2022-12-14 15:27:44,393 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:44,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:44,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1474564222, now seen corresponding path program 7 times [2022-12-14 15:27:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:44,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290047906] [2022-12-14 15:27:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:45,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:45,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290047906] [2022-12-14 15:27:45,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290047906] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:45,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:45,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:27:45,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680257396] [2022-12-14 15:27:45,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:27:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:45,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:27:45,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:27:45,280 INFO L87 Difference]: Start difference. First operand 11372 states and 32755 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:47,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:47,393 INFO L93 Difference]: Finished difference Result 16918 states and 48554 transitions. [2022-12-14 15:27:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 15:27:47,393 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:47,423 INFO L225 Difference]: With dead ends: 16918 [2022-12-14 15:27:47,423 INFO L226 Difference]: Without dead ends: 16918 [2022-12-14 15:27:47,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-12-14 15:27:47,423 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 293 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:47,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 81 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:27:47,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16918 states. [2022-12-14 15:27:47,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16918 to 11222. [2022-12-14 15:27:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11222 states, 11070 states have (on average 2.9263775971093042) internal successors, (32395), 11221 states have internal predecessors, (32395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11222 states to 11222 states and 32395 transitions. [2022-12-14 15:27:47,615 INFO L78 Accepts]: Start accepts. Automaton has 11222 states and 32395 transitions. Word has length 28 [2022-12-14 15:27:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:47,616 INFO L495 AbstractCegarLoop]: Abstraction has 11222 states and 32395 transitions. [2022-12-14 15:27:47,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11222 states and 32395 transitions. [2022-12-14 15:27:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:47,620 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:47,620 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:27:47,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2022-12-14 15:27:47,620 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -782427701, now seen corresponding path program 1 times [2022-12-14 15:27:47,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:47,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048218670] [2022-12-14 15:27:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:47,751 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:47,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:47,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048218670] [2022-12-14 15:27:47,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048218670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:27:47,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234759838] [2022-12-14 15:27:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:27:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:27:47,752 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:27:47,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 15:27:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:47,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:27:47,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:27:48,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:27:48,076 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-12-14 15:27:48,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 28 [2022-12-14 15:27:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:48,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:27:48,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-12-14 15:27:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234759838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:27:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1459395696] [2022-12-14 15:27:48,212 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:27:48,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:27:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 16 [2022-12-14 15:27:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679287207] [2022-12-14 15:27:48,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:27:48,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:27:48,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:48,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:27:48,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:27:48,213 INFO L87 Difference]: Start difference. First operand 11222 states and 32395 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:52,216 INFO L93 Difference]: Finished difference Result 40282 states and 109757 transitions. [2022-12-14 15:27:52,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-12-14 15:27:52,217 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:52,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:52,312 INFO L225 Difference]: With dead ends: 40282 [2022-12-14 15:27:52,312 INFO L226 Difference]: Without dead ends: 39995 [2022-12-14 15:27:52,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1588, Invalid=5218, Unknown=0, NotChecked=0, Total=6806 [2022-12-14 15:27:52,313 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 2561 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 4766 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2561 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 4842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:52,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2561 Valid, 375 Invalid, 4842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4766 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-12-14 15:27:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39995 states. [2022-12-14 15:27:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39995 to 18253. [2022-12-14 15:27:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18253 states, 18101 states have (on average 2.9791724214131814) internal successors, (53926), 18252 states have internal predecessors, (53926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18253 states to 18253 states and 53926 transitions. [2022-12-14 15:27:52,811 INFO L78 Accepts]: Start accepts. Automaton has 18253 states and 53926 transitions. Word has length 28 [2022-12-14 15:27:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:52,811 INFO L495 AbstractCegarLoop]: Abstraction has 18253 states and 53926 transitions. [2022-12-14 15:27:52,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18253 states and 53926 transitions. [2022-12-14 15:27:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:52,816 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:52,816 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-12-14 15:27:52,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 15:27:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:27:53,018 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash 500777352, now seen corresponding path program 8 times [2022-12-14 15:27:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941899852] [2022-12-14 15:27:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:53,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:53,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941899852] [2022-12-14 15:27:53,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941899852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:53,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:53,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:27:53,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407449181] [2022-12-14 15:27:53,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:53,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:27:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:27:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:27:53,975 INFO L87 Difference]: Start difference. First operand 18253 states and 53926 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:55,626 INFO L93 Difference]: Finished difference Result 18797 states and 55304 transitions. [2022-12-14 15:27:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 15:27:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:55,664 INFO L225 Difference]: With dead ends: 18797 [2022-12-14 15:27:55,664 INFO L226 Difference]: Without dead ends: 18797 [2022-12-14 15:27:55,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2022-12-14 15:27:55,665 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 204 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2202 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:55,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 67 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2202 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-12-14 15:27:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18797 states. [2022-12-14 15:27:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18797 to 18223. [2022-12-14 15:27:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18223 states, 18071 states have (on average 2.980244590780809) internal successors, (53856), 18222 states have internal predecessors, (53856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18223 states to 18223 states and 53856 transitions. [2022-12-14 15:27:55,952 INFO L78 Accepts]: Start accepts. Automaton has 18223 states and 53856 transitions. Word has length 28 [2022-12-14 15:27:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:55,952 INFO L495 AbstractCegarLoop]: Abstraction has 18223 states and 53856 transitions. [2022-12-14 15:27:55,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 18223 states and 53856 transitions. [2022-12-14 15:27:55,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:27:55,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:55,957 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-12-14 15:27:55,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2022-12-14 15:27:55,957 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:27:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:55,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1119879640, now seen corresponding path program 9 times [2022-12-14 15:27:55,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:55,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193999490] [2022-12-14 15:27:55,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:55,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:56,700 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:56,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193999490] [2022-12-14 15:27:56,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193999490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:27:56,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:27:56,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-12-14 15:27:56,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998500027] [2022-12-14 15:27:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:27:56,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 15:27:56,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 15:27:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-12-14 15:27:56,701 INFO L87 Difference]: Start difference. First operand 18223 states and 53856 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:27:59,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:59,750 INFO L93 Difference]: Finished difference Result 25107 states and 73205 transitions. [2022-12-14 15:27:59,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 15:27:59,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:27:59,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:59,807 INFO L225 Difference]: With dead ends: 25107 [2022-12-14 15:27:59,807 INFO L226 Difference]: Without dead ends: 25107 [2022-12-14 15:27:59,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=225, Invalid=965, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 15:27:59,808 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 266 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:59,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 120 Invalid, 3275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 15:27:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25107 states. [2022-12-14 15:28:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25107 to 17735. [2022-12-14 15:28:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17583 states have (on average 2.9920946368651538) internal successors, (52610), 17734 states have internal predecessors, (52610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 52610 transitions. [2022-12-14 15:28:00,129 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 52610 transitions. Word has length 28 [2022-12-14 15:28:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:00,129 INFO L495 AbstractCegarLoop]: Abstraction has 17735 states and 52610 transitions. [2022-12-14 15:28:00,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 52610 transitions. [2022-12-14 15:28:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:00,133 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:00,133 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:28:00,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2022-12-14 15:28:00,133 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1455957682, now seen corresponding path program 1 times [2022-12-14 15:28:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:00,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615514375] [2022-12-14 15:28:00,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:00,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:00,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615514375] [2022-12-14 15:28:00,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615514375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:28:00,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652316924] [2022-12-14 15:28:00,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:00,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:28:00,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:28:00,613 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:28:00,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 15:28:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:00,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-14 15:28:00,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:28:00,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:00,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:28:00,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:00,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:28:00,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:28:00,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:28:00,933 INFO L321 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2022-12-14 15:28:00,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2022-12-14 15:28:00,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:00,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:28:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:01,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:28:01,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4703 Int) (v_ArrVal_4701 Int) (v_ArrVal_4699 (Array Int Int)) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< 1 v_ArrVal_4701) (<= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4699))) (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4701) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_4703))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) is different from false [2022-12-14 15:28:01,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4701 Int) (v_ArrVal_4699 (Array Int Int)) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< 1 v_ArrVal_4701) (<= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4699) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4701) |c_ULTIMATE.start_main_~#r~3#1.offset|) 2147483646))) is different from false [2022-12-14 15:28:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:01,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652316924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:28:01,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791546192] [2022-12-14 15:28:01,278 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:28:01,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:28:01,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2022-12-14 15:28:01,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403637439] [2022-12-14 15:28:01,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:28:01,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 15:28:01,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 15:28:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=690, Unknown=2, NotChecked=110, Total=930 [2022-12-14 15:28:01,279 INFO L87 Difference]: Start difference. First operand 17735 states and 52610 transitions. Second operand has 31 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:06,059 INFO L93 Difference]: Finished difference Result 20069 states and 58703 transitions. [2022-12-14 15:28:06,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:28:06,059 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:06,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:06,101 INFO L225 Difference]: With dead ends: 20069 [2022-12-14 15:28:06,101 INFO L226 Difference]: Without dead ends: 20069 [2022-12-14 15:28:06,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=557, Invalid=2311, Unknown=2, NotChecked=210, Total=3080 [2022-12-14 15:28:06,102 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 640 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 3193 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 437 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:06,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 76 Invalid, 3657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3193 Invalid, 0 Unknown, 437 Unchecked, 3.0s Time] [2022-12-14 15:28:06,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20069 states. [2022-12-14 15:28:06,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20069 to 17735. [2022-12-14 15:28:06,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17735 states, 17583 states have (on average 2.9914121594722176) internal successors, (52598), 17734 states have internal predecessors, (52598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:06,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17735 states to 17735 states and 52598 transitions. [2022-12-14 15:28:06,407 INFO L78 Accepts]: Start accepts. Automaton has 17735 states and 52598 transitions. Word has length 28 [2022-12-14 15:28:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:06,407 INFO L495 AbstractCegarLoop]: Abstraction has 17735 states and 52598 transitions. [2022-12-14 15:28:06,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7666666666666666) internal successors, (83), 30 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:06,407 INFO L276 IsEmpty]: Start isEmpty. Operand 17735 states and 52598 transitions. [2022-12-14 15:28:06,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:06,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:06,411 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-12-14 15:28:06,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 15:28:06,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable160 [2022-12-14 15:28:06,613 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash 859637679, now seen corresponding path program 8 times [2022-12-14 15:28:06,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:06,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255859868] [2022-12-14 15:28:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:07,669 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:07,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255859868] [2022-12-14 15:28:07,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255859868] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:07,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:07,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:28:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441057518] [2022-12-14 15:28:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:07,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:28:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:07,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:28:07,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:28:07,670 INFO L87 Difference]: Start difference. First operand 17735 states and 52598 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:10,145 INFO L93 Difference]: Finished difference Result 25161 states and 73284 transitions. [2022-12-14 15:28:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 15:28:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:10,200 INFO L225 Difference]: With dead ends: 25161 [2022-12-14 15:28:10,200 INFO L226 Difference]: Without dead ends: 25161 [2022-12-14 15:28:10,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 15:28:10,201 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 301 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:10,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 78 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3120 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:28:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25161 states. [2022-12-14 15:28:10,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25161 to 17825. [2022-12-14 15:28:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17673 states have (on average 2.988230634300911) internal successors, (52811), 17824 states have internal predecessors, (52811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 52811 transitions. [2022-12-14 15:28:10,543 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 52811 transitions. Word has length 28 [2022-12-14 15:28:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:10,543 INFO L495 AbstractCegarLoop]: Abstraction has 17825 states and 52811 transitions. [2022-12-14 15:28:10,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:10,543 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 52811 transitions. [2022-12-14 15:28:10,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:10,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:10,547 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-12-14 15:28:10,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2022-12-14 15:28:10,547 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:10,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash 361018137, now seen corresponding path program 9 times [2022-12-14 15:28:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669869] [2022-12-14 15:28:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:10,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:11,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:11,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669869] [2022-12-14 15:28:11,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669869] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:11,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:11,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:28:11,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102513647] [2022-12-14 15:28:11,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:11,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:28:11,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:11,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:28:11,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:28:11,551 INFO L87 Difference]: Start difference. First operand 17825 states and 52811 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:14,701 INFO L93 Difference]: Finished difference Result 26705 states and 77303 transitions. [2022-12-14 15:28:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 15:28:14,702 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:14,761 INFO L225 Difference]: With dead ends: 26705 [2022-12-14 15:28:14,761 INFO L226 Difference]: Without dead ends: 26705 [2022-12-14 15:28:14,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=289, Invalid=1271, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 15:28:14,762 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 330 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:14,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 100 Invalid, 3710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-12-14 15:28:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26705 states. [2022-12-14 15:28:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26705 to 17705. [2022-12-14 15:28:15,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17705 states, 17553 states have (on average 2.9913405115934597) internal successors, (52507), 17704 states have internal predecessors, (52507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17705 states to 17705 states and 52507 transitions. [2022-12-14 15:28:15,094 INFO L78 Accepts]: Start accepts. Automaton has 17705 states and 52507 transitions. Word has length 28 [2022-12-14 15:28:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:15,094 INFO L495 AbstractCegarLoop]: Abstraction has 17705 states and 52507 transitions. [2022-12-14 15:28:15,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17705 states and 52507 transitions. [2022-12-14 15:28:15,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:15,098 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:15,098 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-12-14 15:28:15,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2022-12-14 15:28:15,098 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:15,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:15,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1222885575, now seen corresponding path program 10 times [2022-12-14 15:28:15,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:15,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855643375] [2022-12-14 15:28:15,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:16,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:16,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:16,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855643375] [2022-12-14 15:28:16,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855643375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:16,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:16,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-14 15:28:16,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539388084] [2022-12-14 15:28:16,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:16,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-14 15:28:16,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:16,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-14 15:28:16,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-12-14 15:28:16,089 INFO L87 Difference]: Start difference. First operand 17705 states and 52507 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:17,761 INFO L93 Difference]: Finished difference Result 18079 states and 53480 transitions. [2022-12-14 15:28:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:28:17,762 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:17,798 INFO L225 Difference]: With dead ends: 18079 [2022-12-14 15:28:17,798 INFO L226 Difference]: Without dead ends: 18079 [2022-12-14 15:28:17,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-12-14 15:28:17,799 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 198 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:17,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 49 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2241 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-12-14 15:28:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18079 states. [2022-12-14 15:28:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18079 to 17696. [2022-12-14 15:28:18,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17696 states, 17544 states have (on average 2.991678066575467) internal successors, (52486), 17695 states have internal predecessors, (52486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:18,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17696 states to 17696 states and 52486 transitions. [2022-12-14 15:28:18,072 INFO L78 Accepts]: Start accepts. Automaton has 17696 states and 52486 transitions. Word has length 28 [2022-12-14 15:28:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:18,072 INFO L495 AbstractCegarLoop]: Abstraction has 17696 states and 52486 transitions. [2022-12-14 15:28:18,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 17696 states and 52486 transitions. [2022-12-14 15:28:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:18,076 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:18,076 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-12-14 15:28:18,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2022-12-14 15:28:18,077 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1721505117, now seen corresponding path program 11 times [2022-12-14 15:28:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:18,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153282004] [2022-12-14 15:28:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:19,188 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:19,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153282004] [2022-12-14 15:28:19,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153282004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:19,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:19,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:28:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870690344] [2022-12-14 15:28:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:19,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:28:19,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:19,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:28:19,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:28:19,190 INFO L87 Difference]: Start difference. First operand 17696 states and 52486 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:22,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:22,483 INFO L93 Difference]: Finished difference Result 26259 states and 76207 transitions. [2022-12-14 15:28:22,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-14 15:28:22,484 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:22,541 INFO L225 Difference]: With dead ends: 26259 [2022-12-14 15:28:22,541 INFO L226 Difference]: Without dead ends: 26259 [2022-12-14 15:28:22,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=306, Invalid=1334, Unknown=0, NotChecked=0, Total=1640 [2022-12-14 15:28:22,541 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 291 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4173 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:22,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 122 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4173 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-12-14 15:28:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26259 states. [2022-12-14 15:28:22,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26259 to 17615. [2022-12-14 15:28:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17615 states, 17463 states have (on average 2.9945599267021703) internal successors, (52294), 17614 states have internal predecessors, (52294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17615 states to 17615 states and 52294 transitions. [2022-12-14 15:28:22,883 INFO L78 Accepts]: Start accepts. Automaton has 17615 states and 52294 transitions. Word has length 28 [2022-12-14 15:28:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:22,884 INFO L495 AbstractCegarLoop]: Abstraction has 17615 states and 52294 transitions. [2022-12-14 15:28:22,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 17615 states and 52294 transitions. [2022-12-14 15:28:22,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:22,887 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:22,888 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-12-14 15:28:22,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2022-12-14 15:28:22,888 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:22,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:22,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1425078575, now seen corresponding path program 12 times [2022-12-14 15:28:22,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:22,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730364182] [2022-12-14 15:28:22,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:22,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:23,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:23,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730364182] [2022-12-14 15:28:23,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730364182] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:23,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:23,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-12-14 15:28:23,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920364040] [2022-12-14 15:28:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 15:28:23,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:23,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 15:28:23,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-12-14 15:28:23,854 INFO L87 Difference]: Start difference. First operand 17615 states and 52294 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:26,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:26,669 INFO L93 Difference]: Finished difference Result 25205 states and 73422 transitions. [2022-12-14 15:28:26,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 15:28:26,670 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:26,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:26,724 INFO L225 Difference]: With dead ends: 25205 [2022-12-14 15:28:26,724 INFO L226 Difference]: Without dead ends: 25205 [2022-12-14 15:28:26,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=1015, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:28:26,725 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 321 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:26,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 109 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-12-14 15:28:26,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25205 states. [2022-12-14 15:28:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25205 to 17575. [2022-12-14 15:28:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17575 states, 17423 states have (on average 2.996154508408426) internal successors, (52202), 17574 states have internal predecessors, (52202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17575 states to 17575 states and 52202 transitions. [2022-12-14 15:28:27,041 INFO L78 Accepts]: Start accepts. Automaton has 17575 states and 52202 transitions. Word has length 28 [2022-12-14 15:28:27,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:27,041 INFO L495 AbstractCegarLoop]: Abstraction has 17575 states and 52202 transitions. [2022-12-14 15:28:27,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17575 states and 52202 transitions. [2022-12-14 15:28:27,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:27,045 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:27,045 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-12-14 15:28:27,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165 [2022-12-14 15:28:27,045 INFO L420 AbstractCegarLoop]: === Iteration 167 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:27,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1062881231, now seen corresponding path program 13 times [2022-12-14 15:28:27,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:27,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603574296] [2022-12-14 15:28:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:27,885 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:27,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603574296] [2022-12-14 15:28:27,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603574296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:28:27,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:28:27,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-12-14 15:28:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23764998] [2022-12-14 15:28:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:28:27,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:28:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:28:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2022-12-14 15:28:27,887 INFO L87 Difference]: Start difference. First operand 17575 states and 52202 transitions. Second operand has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:29,978 INFO L93 Difference]: Finished difference Result 17695 states and 52501 transitions. [2022-12-14 15:28:29,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-14 15:28:29,978 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:30,016 INFO L225 Difference]: With dead ends: 17695 [2022-12-14 15:28:30,017 INFO L226 Difference]: Without dead ends: 17695 [2022-12-14 15:28:30,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=870, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 15:28:30,017 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 290 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:30,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 91 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 15:28:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17695 states. [2022-12-14 15:28:30,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17695 to 16901. [2022-12-14 15:28:30,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16901 states, 16749 states have (on average 3.014866559197564) internal successors, (50496), 16900 states have internal predecessors, (50496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16901 states to 16901 states and 50496 transitions. [2022-12-14 15:28:30,294 INFO L78 Accepts]: Start accepts. Automaton has 16901 states and 50496 transitions. Word has length 28 [2022-12-14 15:28:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:30,294 INFO L495 AbstractCegarLoop]: Abstraction has 16901 states and 50496 transitions. [2022-12-14 15:28:30,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 16901 states and 50496 transitions. [2022-12-14 15:28:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:30,297 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:30,297 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:28:30,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2022-12-14 15:28:30,297 INFO L420 AbstractCegarLoop]: === Iteration 168 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:30,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1631295933, now seen corresponding path program 1 times [2022-12-14 15:28:30,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:30,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035063350] [2022-12-14 15:28:30,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:30,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:30,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:30,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035063350] [2022-12-14 15:28:30,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035063350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:28:30,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839985204] [2022-12-14 15:28:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:30,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:28:30,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:28:30,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:28:30,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 15:28:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:30,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 87 conjunts are in the unsatisfiable core [2022-12-14 15:28:30,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:28:30,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:30,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:28:30,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:30,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:28:30,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:28:30,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:28:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:31,166 INFO L321 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2022-12-14 15:28:31,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2022-12-14 15:28:31,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:31,296 INFO L321 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-12-14 15:28:31,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 68 [2022-12-14 15:28:31,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:31,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:28:31,750 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4950 (Array Int Int)) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4953 Int) (v_ArrVal_4951 Int)) (or (<= 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4950))) (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4951) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_4953))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (< v_ArrVal_4951 1))) is different from false [2022-12-14 15:28:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:31,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839985204] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:28:31,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1827234894] [2022-12-14 15:28:31,802 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:28:31,802 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:28:31,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 32 [2022-12-14 15:28:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496641007] [2022-12-14 15:28:31,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:28:31,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:28:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:31,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:28:31,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=905, Unknown=2, NotChecked=62, Total=1122 [2022-12-14 15:28:31,803 INFO L87 Difference]: Start difference. First operand 16901 states and 50496 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:34,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:28:36,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:28:38,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:28:38,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse4 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse1 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse7 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse6 (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (and (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4953 Int) (v_ArrVal_4951 Int)) (or (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_4951) (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_4953)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (< v_ArrVal_4951 1))) (let ((.cse3 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (let ((.cse0 (= 0 (select .cse3 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 20)))) (.cse2 (* (div (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (- |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) (- 4)) 4))) (or (and .cse0 (<= 1 (select .cse1 (+ .cse2 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)))) (and (= (select .cse3 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 0) (or (and .cse0 (exists ((|v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_215| Int)) (<= 1 (select .cse1 (+ (* |v_writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1_215| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|))))) (<= 1 (select .cse1 (+ .cse2 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)))))))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4953 Int) (v_ArrVal_4951 Int)) (or (<= 0 (+ (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store .cse1 (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_4951) .cse4 v_ArrVal_4953)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483649)) (not (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1| v_ArrVal_4951)))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4953 Int) (v_ArrVal_4951 Int)) (or (< v_ArrVal_4951 1) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4951) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_4953)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) (forall ((v_ArrVal_4950 (Array Int Int)) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4951 Int)) (or (< v_ArrVal_4951 1) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_4950) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4951) |c_ULTIMATE.start_main_~#r~3#1.offset|))))) .cse5 (or (and .cse5 (= (select .cse1 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) 0) .cse6) (and (= |c_writer_fnThread1of1ForFork0_~i~1#1| 0) (not (= .cse4 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) (<= .cse7 (select .cse1 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) .cse6)) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_4953 Int) (v_ArrVal_4951 Int)) (or (< v_ArrVal_4951 .cse7) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_4951) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20) v_ArrVal_4953)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) .cse6)) is different from false [2022-12-14 15:28:44,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:28:46,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:28:51,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:28:54,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:54,603 INFO L93 Difference]: Finished difference Result 20936 states and 60947 transitions. [2022-12-14 15:28:54,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-12-14 15:28:54,604 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:28:54,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:54,647 INFO L225 Difference]: With dead ends: 20936 [2022-12-14 15:28:54,647 INFO L226 Difference]: Without dead ends: 20936 [2022-12-14 15:28:54,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=742, Invalid=3805, Unknown=17, NotChecked=266, Total=4830 [2022-12-14 15:28:54,648 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 766 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 3423 mSolverCounterSat, 38 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 3423 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:54,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 97 Invalid, 3775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 3423 Invalid, 56 Unknown, 258 Unchecked, 15.6s Time] [2022-12-14 15:28:54,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20936 states. [2022-12-14 15:28:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20936 to 17129. [2022-12-14 15:28:54,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17129 states, 16977 states have (on average 3.0102491606290864) internal successors, (51105), 17128 states have internal predecessors, (51105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17129 states to 17129 states and 51105 transitions. [2022-12-14 15:28:54,948 INFO L78 Accepts]: Start accepts. Automaton has 17129 states and 51105 transitions. Word has length 28 [2022-12-14 15:28:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:54,949 INFO L495 AbstractCegarLoop]: Abstraction has 17129 states and 51105 transitions. [2022-12-14 15:28:54,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 17129 states and 51105 transitions. [2022-12-14 15:28:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 15:28:54,952 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:54,952 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:28:54,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 15:28:55,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable167 [2022-12-14 15:28:55,154 INFO L420 AbstractCegarLoop]: === Iteration 169 === Targeting reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:28:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1631296015, now seen corresponding path program 1 times [2022-12-14 15:28:55,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:55,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816257282] [2022-12-14 15:28:55,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:55,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:55,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:55,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816257282] [2022-12-14 15:28:55,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816257282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:28:55,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104499018] [2022-12-14 15:28:55,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:28:55,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:28:55,657 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:28:55,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 15:28:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:55,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 77 conjunts are in the unsatisfiable core [2022-12-14 15:28:55,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:28:55,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:55,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:28:55,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:55,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:28:55,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:28:55,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:28:56,015 INFO L321 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2022-12-14 15:28:56,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2022-12-14 15:28:56,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:28:56,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-14 15:28:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:56,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:28:56,493 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5023 (Array Int Int)) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (< 1 v_ArrVal_5024) (<= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5023))) (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5027))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) is different from false [2022-12-14 15:28:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:28:56,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104499018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:28:56,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1561497645] [2022-12-14 15:28:56,552 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:28:56,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:28:56,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 32 [2022-12-14 15:28:56,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896556982] [2022-12-14 15:28:56,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:28:56,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:28:56,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:28:56,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:28:56,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=913, Unknown=6, NotChecked=62, Total=1122 [2022-12-14 15:28:56,554 INFO L87 Difference]: Start difference. First operand 17129 states and 51105 transitions. Second operand has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:28:57,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse4 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse3 (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (and (let ((.cse0 (not (= .cse5 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (.cse1 (select .cse4 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (or (and (= |c_writer_fnThread1of1ForFork0_~i~1#1| 0) .cse0 (<= .cse1 .cse2) .cse3) (and .cse0 (= .cse1 0) .cse3))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (< .cse2 v_ArrVal_5024) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20) v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) (<= (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 1) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (< 1 v_ArrVal_5024) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_5024) (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) (<= (select .cse4 (+ (* (div (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (- |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) (- 4)) 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) 1) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646) (< 1 v_ArrVal_5024))) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (forall ((v_ArrVal_5023 (Array Int Int)) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5024 Int)) (or (< 1 v_ArrVal_5024) (<= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5023) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) |c_ULTIMATE.start_main_~#r~3#1.offset|) 2147483646))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (not (<= v_ArrVal_5024 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|)) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store .cse4 (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_5024) .cse5 v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) .cse3)) is different from false [2022-12-14 15:28:58,065 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (.cse4 (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|)) (.cse5 (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) (.cse3 (= |c_reader_twoThread1of1ForFork1_#in~arg#1.base| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|))) (and (let ((.cse0 (not (= .cse5 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (.cse1 (select .cse4 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (or (and (= |c_writer_fnThread1of1ForFork0_~i~1#1| 0) .cse0 (<= .cse1 .cse2) .cse3) (and .cse0 (= .cse1 0) .cse3))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 0) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (< .cse2 v_ArrVal_5024) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20) v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) (<= (select .cse4 (+ (* (div (+ |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset| (- |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) (- 4)) 4) |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|)) 1) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646) (< 1 v_ArrVal_5024))) (= |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) (forall ((v_ArrVal_5023 (Array Int Int)) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5024 Int)) (or (< 1 v_ArrVal_5024) (<= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5023) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5024) |c_ULTIMATE.start_main_~#r~3#1.offset|) 2147483646))) (forall ((|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5027 Int) (v_ArrVal_5024 Int)) (or (not (<= v_ArrVal_5024 |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1|)) (<= (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store .cse4 (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_5024) .cse5 v_ArrVal_5027)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 2147483646))) .cse3)) is different from false [2022-12-14 15:29:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:29:05,636 INFO L93 Difference]: Finished difference Result 22171 states and 63937 transitions. [2022-12-14 15:29:05,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-14 15:29:05,636 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 15:29:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:29:05,683 INFO L225 Difference]: With dead ends: 22171 [2022-12-14 15:29:05,683 INFO L226 Difference]: Without dead ends: 22171 [2022-12-14 15:29:05,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=704, Invalid=3195, Unknown=19, NotChecked=372, Total=4290 [2022-12-14 15:29:05,684 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1206 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 3643 mSolverCounterSat, 40 mSolverCounterUnsat, 61 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3643 IncrementalHoareTripleChecker+Invalid, 61 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:29:05,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 97 Invalid, 4131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3643 Invalid, 61 Unknown, 387 Unchecked, 4.1s Time] [2022-12-14 15:29:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22171 states. [2022-12-14 15:29:05,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22171 to 17185. [2022-12-14 15:29:05,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17185 states, 17033 states have (on average 3.0075148241648564) internal successors, (51227), 17184 states have internal predecessors, (51227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:29:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17185 states to 17185 states and 51227 transitions. [2022-12-14 15:29:05,990 INFO L78 Accepts]: Start accepts. Automaton has 17185 states and 51227 transitions. Word has length 28 [2022-12-14 15:29:05,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:29:05,990 INFO L495 AbstractCegarLoop]: Abstraction has 17185 states and 51227 transitions. [2022-12-14 15:29:05,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:29:05,990 INFO L276 IsEmpty]: Start isEmpty. Operand 17185 states and 51227 transitions. [2022-12-14 15:29:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 15:29:05,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:29:05,994 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:29:06,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 15:29:06,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:29:06,195 INFO L420 AbstractCegarLoop]: === Iteration 170 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:29:06,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:29:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1072528847, now seen corresponding path program 1 times [2022-12-14 15:29:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:29:06,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310059728] [2022-12-14 15:29:06,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:29:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:06,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:29:06,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310059728] [2022-12-14 15:29:06,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310059728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:29:06,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475837299] [2022-12-14 15:29:06,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:29:06,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:29:06,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:29:06,662 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:29:06,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 15:29:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:29:06,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 73 conjunts are in the unsatisfiable core [2022-12-14 15:29:06,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:29:06,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:29:06,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:29:06,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:29:06,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:29:06,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:29:06,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:29:07,040 INFO L321 Elim1Store]: treesize reduction 18, result has 47.1 percent of original size [2022-12-14 15:29:07,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2022-12-14 15:29:07,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:29:07,100 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2022-12-14 15:29:07,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2022-12-14 15:29:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:07,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:29:07,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5099 Int) (v_ArrVal_5096 (Array Int Int))) (or (< v_ArrVal_5097 1) (<= 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5096))) (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5097) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5099))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) is different from false [2022-12-14 15:29:07,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:29:07,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475837299] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:29:07,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1521670635] [2022-12-14 15:29:07,571 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:29:07,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:29:07,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2022-12-14 15:29:07,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936290336] [2022-12-14 15:29:07,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:29:07,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 15:29:07,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:29:07,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 15:29:07,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=798, Unknown=4, NotChecked=58, Total=992 [2022-12-14 15:29:07,572 INFO L87 Difference]: Start difference. First operand 17185 states and 51227 transitions. Second operand has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:29:09,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:11,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:14,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:16,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:17,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:19,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:21,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:23,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:25,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:27,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:29,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:31,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:33,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:35,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:37,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:39,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:41,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:43,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:45,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:47,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:49,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:49,912 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5096 (Array Int Int))) (or (< v_ArrVal_5097 1) (<= 0 (+ 2147483649 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5096) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5097) |c_ULTIMATE.start_main_~#r~3#1.offset|))))) (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5099 Int)) (or (< v_ArrVal_5097 (+ |c_writer_fnThread1of1ForFork0_~i~1#1| 1)) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5097) (+ |c_writer_fnThread1of1ForFork0_~r~1#1.offset| 20) v_ArrVal_5099)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5099 Int)) (or (< v_ArrVal_5097 1) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_5097) (+ 20 |c_writer_fnThread1of1ForFork0_#in~arg#1.offset|) v_ArrVal_5099)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5099 Int)) (or (< v_ArrVal_5097 1) (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5097) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5099)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) (forall ((v_ArrVal_5097 Int) (|writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| Int) (v_ArrVal_5099 Int)) (or (<= 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| (store (store (select |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) (+ (* |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6#1| 4) 4 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_5097) (+ 20 |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.offset|) v_ArrVal_5099)) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))) (not (<= |c_writer_fnThread1of1ForFork0_ring_enqueue_~x#1| v_ArrVal_5097)))) (<= 0 (+ 2147483649 (select (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base|) |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.offset|)))) is different from false [2022-12-14 15:29:51,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:57,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:29:59,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:30:03,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:30:07,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:30:10,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:30:10,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:10,916 INFO L93 Difference]: Finished difference Result 22694 states and 66337 transitions. [2022-12-14 15:30:10,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-14 15:30:10,917 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-12-14 15:30:10,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:10,967 INFO L225 Difference]: With dead ends: 22694 [2022-12-14 15:30:10,967 INFO L226 Difference]: Without dead ends: 22694 [2022-12-14 15:30:10,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=832, Invalid=2240, Unknown=16, NotChecked=218, Total=3306 [2022-12-14 15:30:10,967 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 814 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3424 mSolverCounterSat, 82 mSolverCounterUnsat, 135 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3424 IncrementalHoareTripleChecker+Invalid, 135 IncrementalHoareTripleChecker+Unknown, 296 IncrementalHoareTripleChecker+Unchecked, 59.6s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:10,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 84 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3424 Invalid, 135 Unknown, 296 Unchecked, 59.6s Time] [2022-12-14 15:30:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22694 states. [2022-12-14 15:30:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22694 to 18500. [2022-12-14 15:30:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18500 states, 18348 states have (on average 2.9920972313058645) internal successors, (54899), 18499 states have internal predecessors, (54899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18500 states to 18500 states and 54899 transitions. [2022-12-14 15:30:11,289 INFO L78 Accepts]: Start accepts. Automaton has 18500 states and 54899 transitions. Word has length 29 [2022-12-14 15:30:11,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:11,289 INFO L495 AbstractCegarLoop]: Abstraction has 18500 states and 54899 transitions. [2022-12-14 15:30:11,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:11,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18500 states and 54899 transitions. [2022-12-14 15:30:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:30:11,294 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:11,294 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-12-14 15:30:11,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 15:30:11,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2022-12-14 15:30:11,496 INFO L420 AbstractCegarLoop]: === Iteration 171 === Targeting reader_twoErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:30:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:11,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1758816836, now seen corresponding path program 1 times [2022-12-14 15:30:11,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:30:11,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439201118] [2022-12-14 15:30:11,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:11,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:30:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:11,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:11,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:30:11,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439201118] [2022-12-14 15:30:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439201118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:30:11,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:30:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:30:11,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209046634] [2022-12-14 15:30:11,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:30:11,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:30:11,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:30:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:30:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:30:11,570 INFO L87 Difference]: Start difference. First operand 18500 states and 54899 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:11,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:11,778 INFO L93 Difference]: Finished difference Result 22846 states and 67728 transitions. [2022-12-14 15:30:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:30:11,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:30:11,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:11,830 INFO L225 Difference]: With dead ends: 22846 [2022-12-14 15:30:11,830 INFO L226 Difference]: Without dead ends: 22846 [2022-12-14 15:30:11,830 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-12-14 15:30:11,831 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:11,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 28 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:30:11,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22846 states. [2022-12-14 15:30:12,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22846 to 19920. [2022-12-14 15:30:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19920 states, 19768 states have (on average 2.9838628085795222) internal successors, (58985), 19919 states have internal predecessors, (58985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19920 states to 19920 states and 58985 transitions. [2022-12-14 15:30:12,173 INFO L78 Accepts]: Start accepts. Automaton has 19920 states and 58985 transitions. Word has length 30 [2022-12-14 15:30:12,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:12,173 INFO L495 AbstractCegarLoop]: Abstraction has 19920 states and 58985 transitions. [2022-12-14 15:30:12,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 19920 states and 58985 transitions. [2022-12-14 15:30:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:30:12,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:12,178 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:30:12,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2022-12-14 15:30:12,179 INFO L420 AbstractCegarLoop]: === Iteration 172 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:30:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash -984052422, now seen corresponding path program 1 times [2022-12-14 15:30:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:30:12,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020500648] [2022-12-14 15:30:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:30:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:13,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:30:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020500648] [2022-12-14 15:30:13,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020500648] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:30:13,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251751122] [2022-12-14 15:30:13,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:13,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:13,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:13,029 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:13,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 15:30:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:13,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 105 conjunts are in the unsatisfiable core [2022-12-14 15:30:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:13,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:13,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:30:13,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:30:13,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:13,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:13,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:30:13,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:13,571 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 15:30:13,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 15:30:13,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:13,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:13,631 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:30:13,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 15:30:14,021 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:30:14,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 15:30:14,034 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 15:30:14,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 15:30:14,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:14,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:14,273 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5211 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_609| Int)) (or (< 0 (+ (select (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_5211) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_609|) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4))) 2147483650)) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_609|)) (< (let ((.cse0 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 4 (* (select .cse0 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 4)))) |v_reader_twoThread1of1ForFork1_~val~1#1_609|))) is different from false [2022-12-14 15:30:15,277 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5211 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_609| Int) (v_ArrVal_5206 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~#read~0#1.base_277| Int) (v_ArrVal_5210 Int)) (let ((.cse2 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5206))) (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse4 .cse5) 4) 4) 1)) .cse5 v_ArrVal_5210)))))) (let ((.cse0 (select .cse2 |v_reader_twoThread1of1ForFork1_~#read~0#1.base_277|))) (or (not (<= 0 (select .cse0 0))) (not (= (select .cse0 4) 0)) (< (let ((.cse1 (select .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse1 (+ (* (select .cse1 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))) |v_reader_twoThread1of1ForFork1_~val~1#1_609|) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_609|)) (< 0 (+ (select (select (store .cse2 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5211) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_277|) (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_609|) (- 4))) 2147483650)))))) is different from false [2022-12-14 15:30:15,311 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5211 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_609| Int) (v_ArrVal_5206 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~#read~0#1.base_277| Int) (v_ArrVal_5210 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5206))) (let ((.cse3 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse5 .cse4) 4) 4) 1)))) (let ((.cse2 (store .cse3 .cse4 v_ArrVal_5210))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| .cse2) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_277|))) (or (not (<= 0 (select .cse0 0))) (not (= (select .cse0 4) 0)) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_609|)) (< 0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5211) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_277|) (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_609|) (- 4))) 2147483650)) (< (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4)) |v_reader_twoThread1of1ForFork1_~val~1#1_609|))))))) is different from false [2022-12-14 15:30:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:15,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251751122] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:15,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1543834832] [2022-12-14 15:30:15,315 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:30:15,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:30:15,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 40 [2022-12-14 15:30:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417475768] [2022-12-14 15:30:15,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:15,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:30:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:30:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:30:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=12, NotChecked=228, Total=1722 [2022-12-14 15:30:15,316 INFO L87 Difference]: Start difference. First operand 19920 states and 58985 transitions. Second operand has 42 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 41 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:27,276 INFO L93 Difference]: Finished difference Result 27718 states and 80536 transitions. [2022-12-14 15:30:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-14 15:30:27,277 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 41 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:30:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:27,340 INFO L225 Difference]: With dead ends: 27718 [2022-12-14 15:30:27,340 INFO L226 Difference]: Without dead ends: 27718 [2022-12-14 15:30:27,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=720, Invalid=4109, Unknown=13, NotChecked=414, Total=5256 [2022-12-14 15:30:27,340 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 634 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 7702 mSolverCounterSat, 34 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 8780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 7702 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 1042 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:27,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 249 Invalid, 8780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 7702 Invalid, 2 Unknown, 1042 Unchecked, 8.5s Time] [2022-12-14 15:30:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27718 states. [2022-12-14 15:30:27,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27718 to 19762. [2022-12-14 15:30:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19762 states, 19610 states have (on average 2.9864864864864864) internal successors, (58565), 19761 states have internal predecessors, (58565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19762 states to 19762 states and 58565 transitions. [2022-12-14 15:30:27,707 INFO L78 Accepts]: Start accepts. Automaton has 19762 states and 58565 transitions. Word has length 30 [2022-12-14 15:30:27,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:27,707 INFO L495 AbstractCegarLoop]: Abstraction has 19762 states and 58565 transitions. [2022-12-14 15:30:27,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.1951219512195124) internal successors, (90), 41 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:27,707 INFO L276 IsEmpty]: Start isEmpty. Operand 19762 states and 58565 transitions. [2022-12-14 15:30:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 15:30:27,712 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:27,712 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:30:27,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 15:30:27,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2022-12-14 15:30:27,913 INFO L420 AbstractCegarLoop]: === Iteration 173 === Targeting reader_twoErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:30:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash 12361047, now seen corresponding path program 1 times [2022-12-14 15:30:27,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:30:27,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940227719] [2022-12-14 15:30:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:27,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:30:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:28,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:30:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940227719] [2022-12-14 15:30:28,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940227719] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:30:28,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589363276] [2022-12-14 15:30:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:28,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:28,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:28,781 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:28,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 15:30:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:28,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-14 15:30:28,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:29,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:30:29,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:30:29,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:29,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:29,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:30:29,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:29,261 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-12-14 15:30:29,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 38 [2022-12-14 15:30:29,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:29,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:29,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:30:29,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 15:30:29,687 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:30:29,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 48 [2022-12-14 15:30:29,698 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-12-14 15:30:29,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 15:30:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:29,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:31,261 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5293 Int) (v_ArrVal_5289 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~#read~0#1.base_279| Int) (|v_reader_twoThread1of1ForFork1_~val~1#1_612| Int) (v_ArrVal_5294 (Array Int Int))) (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5289))) (store .cse3 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse4 .cse5)) 4) 1)) .cse5 v_ArrVal_5293)))))) (let ((.cse2 (select .cse0 |v_reader_twoThread1of1ForFork1_~#read~0#1.base_279|))) (or (< 0 (+ (select (select (store .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base| v_ArrVal_5294) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_279|) (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_612|) (- 4))) 2147483650)) (< (let ((.cse1 (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse1 (+ (* (select .cse1 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4))) |v_reader_twoThread1of1ForFork1_~val~1#1_612|) (not (= (select .cse2 4) 0)) (not (<= 0 (select .cse2 0))) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_612|)))))) is different from false [2022-12-14 15:30:31,321 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5293 Int) (v_ArrVal_5289 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_612| Int) (|v_reader_twoThread1of1ForFork1_~#read~0#1.base_279| Int) (v_ArrVal_5294 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5289))) (let ((.cse3 (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse5 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse5 .cse4)) 4) 1)))) (let ((.cse2 (store .cse3 .cse4 v_ArrVal_5293))) (let ((.cse0 (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| .cse2) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_279|))) (or (not (= (select .cse0 4) 0)) (not (<= 0 (select .cse0 0))) (< 0 (+ (select (select (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_5294) |v_reader_twoThread1of1ForFork1_~#read~0#1.base_279|) (+ (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_612|) (- 4))) 2147483650)) (< (select .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse3 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4))) |v_reader_twoThread1of1ForFork1_~val~1#1_612|) (not (< 0 |v_reader_twoThread1of1ForFork1_~val~1#1_612|)))))))) is different from false [2022-12-14 15:30:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:31,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589363276] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:31,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1559707762] [2022-12-14 15:30:31,324 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:30:31,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:30:31,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 43 [2022-12-14 15:30:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509322893] [2022-12-14 15:30:31,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:31,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-14 15:30:31,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:30:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-14 15:30:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1650, Unknown=20, NotChecked=166, Total=1980 [2022-12-14 15:30:31,325 INFO L87 Difference]: Start difference. First operand 19762 states and 58565 transitions. Second operand has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:30:43,976 INFO L93 Difference]: Finished difference Result 27402 states and 79647 transitions. [2022-12-14 15:30:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-14 15:30:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 15:30:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:30:44,039 INFO L225 Difference]: With dead ends: 27402 [2022-12-14 15:30:44,039 INFO L226 Difference]: Without dead ends: 27402 [2022-12-14 15:30:44,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=942, Invalid=5526, Unknown=20, NotChecked=318, Total=6806 [2022-12-14 15:30:44,040 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 910 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 7153 mSolverCounterSat, 65 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 7153 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-12-14 15:30:44,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 234 Invalid, 7901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 7153 Invalid, 1 Unknown, 682 Unchecked, 8.8s Time] [2022-12-14 15:30:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27402 states. [2022-12-14 15:30:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27402 to 19554. [2022-12-14 15:30:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19554 states, 19402 states have (on average 2.990464900525719) internal successors, (58021), 19553 states have internal predecessors, (58021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19554 states to 19554 states and 58021 transitions. [2022-12-14 15:30:44,412 INFO L78 Accepts]: Start accepts. Automaton has 19554 states and 58021 transitions. Word has length 30 [2022-12-14 15:30:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:30:44,412 INFO L495 AbstractCegarLoop]: Abstraction has 19554 states and 58021 transitions. [2022-12-14 15:30:44,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0454545454545454) internal successors, (90), 44 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:44,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19554 states and 58021 transitions. [2022-12-14 15:30:44,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 15:30:44,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:30:44,417 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 15:30:44,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 15:30:44,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable172,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:44,619 INFO L420 AbstractCegarLoop]: === Iteration 174 === Targeting reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [reader_twoErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, reader_twoErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 43 more)] === [2022-12-14 15:30:44,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:30:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 992406670, now seen corresponding path program 1 times [2022-12-14 15:30:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:30:44,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810093863] [2022-12-14 15:30:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:30:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:45,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:30:45,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810093863] [2022-12-14 15:30:45,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810093863] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:30:45,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230584856] [2022-12-14 15:30:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:30:45,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:30:45,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:30:45,415 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:30:45,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84ca6fd6-93ee-4a42-92c7-cb7bb60f369c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 15:30:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:30:45,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 91 conjunts are in the unsatisfiable core [2022-12-14 15:30:45,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:30:45,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:45,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-14 15:30:45,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:45,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:45,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-14 15:30:45,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-12-14 15:30:45,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:45,947 INFO L321 Elim1Store]: treesize reduction 37, result has 49.3 percent of original size [2022-12-14 15:30:45,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 54 [2022-12-14 15:30:46,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:46,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:30:46,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:30:46,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:30:46,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:30:46,110 INFO L321 Elim1Store]: treesize reduction 47, result has 50.0 percent of original size [2022-12-14 15:30:46,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 111 [2022-12-14 15:30:46,402 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-12-14 15:30:46,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 43 [2022-12-14 15:30:46,480 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:46,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:30:55,785 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5372 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| Int) (v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5375 Int) (v_ArrVal_5374 Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< v_ArrVal_5375 2) (< v_ArrVal_5372 1) (< 0 (+ 2147483650 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5370))) (store .cse0 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5372) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20) v_ArrVal_5374) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| 4) 4) v_ArrVal_5375))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|))))) is different from false [2022-12-14 15:30:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:30:55,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230584856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:30:55,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [401329436] [2022-12-14 15:30:55,893 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 15:30:55,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:30:55,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 40 [2022-12-14 15:30:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465934400] [2022-12-14 15:30:55,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:30:55,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-12-14 15:30:55,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:30:55,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-12-14 15:30:55,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1437, Unknown=22, NotChecked=78, Total=1722 [2022-12-14 15:30:55,894 INFO L87 Difference]: Start difference. First operand 19554 states and 58021 transitions. Second operand has 42 states, 41 states have (on average 2.341463414634146) internal successors, (96), 41 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:30:58,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:31:09,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:11,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:31:19,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:22,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:31:24,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:26,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:29,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20)) (.cse2 (= |c_ULTIMATE.start_ring_enqueue_~r#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|)) (.cse3 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 1)) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (.cse8 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| 20))) (and (= |c_reader_twoThread1of1ForFork1_~r~2#1.base| |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (= |c_ULTIMATE.start_ring_enqueue_~r#1.offset| |c_ULTIMATE.start_writer_fn_~r~1#1.offset|) (forall ((v_ArrVal_5372 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| Int) (v_ArrVal_5375 Int) (v_ArrVal_5374 Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< v_ArrVal_5375 2) (< v_ArrVal_5372 1) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5372) .cse0 v_ArrVal_5374) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| 4) 4) v_ArrVal_5375)) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))))) (forall ((v_ArrVal_5372 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| Int) (v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5375 Int) (v_ArrVal_5374 Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< v_ArrVal_5375 2) (< v_ArrVal_5372 1) (< 0 (+ 2147483650 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5370))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5372) .cse0 v_ArrVal_5374) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| 4) 4) v_ArrVal_5375))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|))))) .cse2 (<= 0 |c_ULTIMATE.start_writer_fn_~i~1#1|) (let ((.cse6 (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base|))) (let ((.cse5 (= (select .cse6 (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 20)) 0))) (or (and (<= .cse3 (select .cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* (div (+ |c_reader_twoThread1of1ForFork1_~r~2#1.offset| (- |c_ULTIMATE.start_ring_enqueue_~r#1.offset|)) 4) 4)))) .cse5) (and (= (select .cse6 |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 0) (or (and (exists ((|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_259| Int)) (<= .cse3 (select .cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_259| 4) 4)))) .cse5) (<= .cse3 (select .cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* 4 (div (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (- |c_reader_twoThread1of1ForFork1_~r~2#1.offset|)) (- 4))) 20)))))))) (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) (= |c_reader_twoThread1of1ForFork1_~r~2#1.offset| 0) (= |c_ULTIMATE.start_writer_fn_~i~1#1| 0) (forall ((v_ArrVal_5372 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| Int) (v_ArrVal_5375 Int) (v_ArrVal_5374 Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< 0 (+ (select (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| (store (store .cse4 (+ |c_ULTIMATE.start_ring_enqueue_~r#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5372) .cse8 v_ArrVal_5374)))) (store .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base| (store (select .cse7 |c_ULTIMATE.start_writer_fn_~r~1#1.base|) (+ |c_ULTIMATE.start_writer_fn_~r~1#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| 4) 4) v_ArrVal_5375))) |c_reader_twoThread1of1ForFork1_~r~2#1.base|) |c_reader_twoThread1of1ForFork1_~r~2#1.offset|) 2147483650)) (not (<= |c_ULTIMATE.start_ring_enqueue_~x#1| v_ArrVal_5372)) (< v_ArrVal_5375 (+ |c_ULTIMATE.start_writer_fn_~i~1#1| 2)))) (forall ((v_ArrVal_5372 Int) (|v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| Int) (v_ArrVal_5370 (Array Int Int)) (v_ArrVal_5375 Int) (v_ArrVal_5374 Int) (|ULTIMATE.start_ring_enqueue_#t~mem6#1| Int)) (or (< v_ArrVal_5375 2) (< v_ArrVal_5372 1) (< 0 (+ (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_5370) |c_ULTIMATE.start_main_~#r~3#1.base|) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |ULTIMATE.start_ring_enqueue_#t~mem6#1| 4) 4) v_ArrVal_5372) .cse0 v_ArrVal_5374) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* |v_ULTIMATE.start_ring_enqueue_#t~mem6#1_263| 4) 4) v_ArrVal_5375) |c_ULTIMATE.start_main_~#r~3#1.offset|) 2147483650)))) (let ((.cse10 (not (= |c_ULTIMATE.start_writer_fn_~r~1#1.offset| .cse8))) (.cse9 (select .cse4 |c_ULTIMATE.start_writer_fn_~r~1#1.offset|))) (or (and (= .cse9 0) .cse2 .cse10 (= |c_reader_twoThread1of1ForFork1_ring_empty_~r#1.base| |c_ULTIMATE.start_ring_enqueue_~r#1.base|)) (and .cse2 .cse10 (<= .cse3 .cse9)))))) is different from false [2022-12-14 15:31:31,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:33,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:35,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:38,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:50,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:31:57,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:02,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:04,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:12,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:15,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:17,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:32:18,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:31,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:32:35,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:37,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:32:39,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:41,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:54,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:32:57,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:32:59,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:33:01,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:03,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:22,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:33:25,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:33:27,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:43,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:45,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:33:47,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:50,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:33:52,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:19,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:21,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:23,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:30,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:34:32,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:34:34,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:36,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:38,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:40,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:42,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:46,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:34:48,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:34:55,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:57,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:34:58,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:35:01,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:35:10,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:35:12,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:35:14,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:35:16,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:06,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:22,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:24,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:45,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 15:36:47,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:36:50,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:36:52,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]