./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-4e7fbc6 [2022-11-23 13:49:56,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 13:49:56,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 13:49:56,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 13:49:56,430 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 13:49:56,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 13:49:56,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 13:49:56,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 13:49:56,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 13:49:56,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 13:49:56,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 13:49:56,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 13:49:56,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 13:49:56,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 13:49:56,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 13:49:56,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 13:49:56,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 13:49:56,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 13:49:56,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 13:49:56,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 13:49:56,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 13:49:56,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 13:49:56,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 13:49:56,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 13:49:56,477 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 13:49:56,483 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 13:49:56,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 13:49:56,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 13:49:56,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 13:49:56,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 13:49:56,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 13:49:56,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 13:49:56,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 13:49:56,491 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 13:49:56,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 13:49:56,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 13:49:56,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 13:49:56,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 13:49:56,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 13:49:56,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 13:49:56,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 13:49:56,497 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 13:49:56,533 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 13:49:56,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 13:49:56,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 13:49:56,534 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 13:49:56,535 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 13:49:56,535 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 13:49:56,535 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 13:49:56,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 13:49:56,536 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 13:49:56,536 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 13:49:56,537 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 13:49:56,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 13:49:56,538 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 13:49:56,538 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 13:49:56,538 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 13:49:56,538 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 13:49:56,538 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 13:49:56,539 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 13:49:56,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 13:49:56,540 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 13:49:56,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 13:49:56,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 13:49:56,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 13:49:56,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 13:49:56,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 13:49:56,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 13:49:56,541 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 13:49:56,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 13:49:56,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 13:49:56,542 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 13:49:56,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 13:49:56,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 13:49:56,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:49:56,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 13:49:56,543 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 13:49:56,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 13:49:56,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 13:49:56,544 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 13:49:56,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 13:49:56,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 13:49:56,545 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 13:49:56,545 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/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_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 509c3c8c1895397e4c0d03f6462ad0ca0ed3ce99b40d08b775ab8473dba5ee1f [2022-11-23 13:49:56,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 13:49:56,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 13:49:56,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 13:49:56,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 13:49:56,849 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 13:49:56,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-11-23 13:49:59,755 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 13:50:00,054 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 13:50:00,055 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2022-11-23 13:50:00,072 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/data/bf83b0e97/58eb5a2a0c1e491cbdd786aa08615526/FLAG86cb13e24 [2022-11-23 13:50:00,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/data/bf83b0e97/58eb5a2a0c1e491cbdd786aa08615526 [2022-11-23 13:50:00,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 13:50:00,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 13:50:00,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 13:50:00,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 13:50:00,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 13:50:00,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371aeb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00, skipping insertion in model container [2022-11-23 13:50:00,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 13:50:00,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 13:50:00,334 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 13:50:00,595 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-23 13:50:00,600 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-23 13:50:00,601 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-23 13:50:00,666 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-23 13:50:00,667 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-23 13:50:00,669 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-23 13:50:00,669 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-23 13:50:00,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:50:00,685 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 13:50:00,697 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-23 13:50:00,717 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2022-11-23 13:50:00,718 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2022-11-23 13:50:00,718 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2022-11-23 13:50:00,729 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2022-11-23 13:50:00,730 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2022-11-23 13:50:00,731 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2022-11-23 13:50:00,732 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_a92a4c30-4275-4316-b654-4ea0b0c1a393/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2022-11-23 13:50:00,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 13:50:00,817 INFO L208 MainTranslator]: Completed translation [2022-11-23 13:50:00,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00 WrapperNode [2022-11-23 13:50:00,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 13:50:00,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 13:50:00,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 13:50:00,823 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 13:50:00,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,860 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,914 INFO L138 Inliner]: procedures = 310, calls = 70, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 203 [2022-11-23 13:50:00,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 13:50:00,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 13:50:00,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 13:50:00,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 13:50:00,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,943 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 13:50:00,949 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 13:50:00,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 13:50:00,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 13:50:00,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (1/1) ... [2022-11-23 13:50:00,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 13:50:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:50:00,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 13:50:01,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 13:50:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2022-11-23 13:50:01,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2022-11-23 13:50:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2022-11-23 13:50:01,041 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2022-11-23 13:50:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 13:50:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 13:50:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 13:50:01,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 13:50:01,044 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 13:50:01,221 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 13:50:01,223 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 13:50:01,660 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 13:50:01,669 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 13:50:01,669 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-23 13:50:01,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:01 BoogieIcfgContainer [2022-11-23 13:50:01,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 13:50:01,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 13:50:01,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 13:50:01,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 13:50:01,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:50:00" (1/3) ... [2022-11-23 13:50:01,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:01, skipping insertion in model container [2022-11-23 13:50:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:50:00" (2/3) ... [2022-11-23 13:50:01,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2449969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:50:01, skipping insertion in model container [2022-11-23 13:50:01,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:50:01" (3/3) ... [2022-11-23 13:50:01,680 INFO L112 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2022-11-23 13:50:01,695 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 13:50:01,705 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 13:50:01,705 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-11-23 13:50:01,705 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 13:50:01,813 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-23 13:50:01,850 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 13:50:01,869 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 233 transitions, 482 flow [2022-11-23 13:50:01,879 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 233 transitions, 482 flow [2022-11-23 13:50:01,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 233 transitions, 482 flow [2022-11-23 13:50:02,024 INFO L130 PetriNetUnfolder]: 17/231 cut-off events. [2022-11-23 13:50:02,025 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-23 13:50:02,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 17/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 462 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2022-11-23 13:50:02,047 INFO L119 LiptonReduction]: Number of co-enabled transitions 19012 [2022-11-23 13:50:09,704 INFO L134 LiptonReduction]: Checked pairs total: 41023 [2022-11-23 13:50:09,705 INFO L136 LiptonReduction]: Total number of compositions: 217 [2022-11-23 13:50:09,715 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 62 transitions, 140 flow [2022-11-23 13:50:09,872 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:09,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 13:50:09,905 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;@3560996a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 13:50:09,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2022-11-23 13:50:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:09,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 13:50:09,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:09,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:09,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 682624271, now seen corresponding path program 1 times [2022-11-23 13:50:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:09,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554953639] [2022-11-23 13:50:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:10,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554953639] [2022-11-23 13:50:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554953639] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:10,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:10,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 13:50:10,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13590888] [2022-11-23 13:50:10,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:10,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 13:50:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:10,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 13:50:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 13:50:10,235 INFO L87 Difference]: Start difference. First operand has 2350 states, 2345 states have (on average 3.5074626865671643) internal successors, (8225), 2349 states have internal predecessors, (8225), 0 states have call successors, (0), 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, 2 states have (on average 6.5) internal successors, (13), 2 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-11-23 13:50:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:10,364 INFO L93 Difference]: Finished difference Result 2350 states and 7661 transitions. [2022-11-23 13:50:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 13:50:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-11-23 13:50:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:10,399 INFO L225 Difference]: With dead ends: 2350 [2022-11-23 13:50:10,399 INFO L226 Difference]: Without dead ends: 2348 [2022-11-23 13:50:10,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11-23 13:50:10,403 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:10,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:50:10,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2022-11-23 13:50:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 2348. [2022-11-23 13:50:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2348 states, 2344 states have (on average 3.2670648464163823) internal successors, (7658), 2347 states have internal predecessors, (7658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2348 states to 2348 states and 7658 transitions. [2022-11-23 13:50:10,566 INFO L78 Accepts]: Start accepts. Automaton has 2348 states and 7658 transitions. Word has length 13 [2022-11-23 13:50:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:10,567 INFO L495 AbstractCegarLoop]: Abstraction has 2348 states and 7658 transitions. [2022-11-23 13:50:10,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-11-23 13:50:10,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2348 states and 7658 transitions. [2022-11-23 13:50:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 13:50:10,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:10,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:10,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 13:50:10,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:10,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1514052737, now seen corresponding path program 1 times [2022-11-23 13:50:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:10,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423615098] [2022-11-23 13:50:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:11,696 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:11,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423615098] [2022-11-23 13:50:11,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423615098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:11,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:11,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 13:50:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770882764] [2022-11-23 13:50:11,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:11,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 13:50:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:11,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 13:50:11,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-23 13:50:11,700 INFO L87 Difference]: Start difference. First operand 2348 states and 7658 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-23 13:50:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:12,028 INFO L93 Difference]: Finished difference Result 2336 states and 7632 transitions. [2022-11-23 13:50:12,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:50:12,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-23 13:50:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:12,044 INFO L225 Difference]: With dead ends: 2336 [2022-11-23 13:50:12,044 INFO L226 Difference]: Without dead ends: 2336 [2022-11-23 13:50:12,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-23 13:50:12,046 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:12,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 13:50:12,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2336 states. [2022-11-23 13:50:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2336 to 2336. [2022-11-23 13:50:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2336 states, 2332 states have (on average 3.272727272727273) internal successors, (7632), 2335 states have internal predecessors, (7632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 7632 transitions. [2022-11-23 13:50:12,127 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 7632 transitions. Word has length 17 [2022-11-23 13:50:12,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:12,128 INFO L495 AbstractCegarLoop]: Abstraction has 2336 states and 7632 transitions. [2022-11-23 13:50:12,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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-11-23 13:50:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 7632 transitions. [2022-11-23 13:50:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:50:12,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:12,131 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:12,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 13:50:12,131 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:12,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1402138809, now seen corresponding path program 1 times [2022-11-23 13:50:12,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:12,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229926368] [2022-11-23 13:50:12,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:12,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:12,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:12,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229926368] [2022-11-23 13:50:12,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229926368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:12,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:12,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:50:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243564285] [2022-11-23 13:50:12,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:12,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:50:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:50:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:50:12,746 INFO L87 Difference]: Start difference. First operand 2336 states and 7632 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:13,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:13,178 INFO L93 Difference]: Finished difference Result 3120 states and 10350 transitions. [2022-11-23 13:50:13,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:50:13,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:13,198 INFO L225 Difference]: With dead ends: 3120 [2022-11-23 13:50:13,198 INFO L226 Difference]: Without dead ends: 3109 [2022-11-23 13:50:13,199 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-11-23 13:50:13,200 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:13,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 8 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 13:50:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3109 states. [2022-11-23 13:50:13,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3109 to 2909. [2022-11-23 13:50:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2909 states, 2905 states have (on average 3.2922547332185887) internal successors, (9564), 2908 states have internal predecessors, (9564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 9564 transitions. [2022-11-23 13:50:13,306 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 9564 transitions. Word has length 18 [2022-11-23 13:50:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:13,307 INFO L495 AbstractCegarLoop]: Abstraction has 2909 states and 9564 transitions. [2022-11-23 13:50:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 9564 transitions. [2022-11-23 13:50:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 13:50:13,310 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:13,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:13,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 13:50:13,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:13,311 INFO L85 PathProgramCache]: Analyzing trace with hash -531186711, now seen corresponding path program 2 times [2022-11-23 13:50:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:13,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524606692] [2022-11-23 13:50:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:14,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:14,001 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:14,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524606692] [2022-11-23 13:50:14,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524606692] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:14,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:14,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 13:50:14,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042094847] [2022-11-23 13:50:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:14,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 13:50:14,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:14,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 13:50:14,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-23 13:50:14,004 INFO L87 Difference]: Start difference. First operand 2909 states and 9564 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:14,495 INFO L93 Difference]: Finished difference Result 2879 states and 9435 transitions. [2022-11-23 13:50:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 13:50:14,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:14,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:14,514 INFO L225 Difference]: With dead ends: 2879 [2022-11-23 13:50:14,514 INFO L226 Difference]: Without dead ends: 2878 [2022-11-23 13:50:14,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-11-23 13:50:14,519 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:14,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 8 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 13:50:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2878 states. [2022-11-23 13:50:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2878 to 2829. [2022-11-23 13:50:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2829 states, 2825 states have (on average 3.282477876106195) internal successors, (9273), 2828 states have internal predecessors, (9273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 9273 transitions. [2022-11-23 13:50:14,629 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 9273 transitions. Word has length 18 [2022-11-23 13:50:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:14,633 INFO L495 AbstractCegarLoop]: Abstraction has 2829 states and 9273 transitions. [2022-11-23 13:50:14,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 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-11-23 13:50:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 9273 transitions. [2022-11-23 13:50:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:14,639 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:14,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:14,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 13:50:14,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -832907398, now seen corresponding path program 1 times [2022-11-23 13:50:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:14,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970159265] [2022-11-23 13:50:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:15,979 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:15,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970159265] [2022-11-23 13:50:15,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970159265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:15,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:15,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:15,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132905223] [2022-11-23 13:50:15,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:15,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:15,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:15,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:15,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:15,981 INFO L87 Difference]: Start difference. First operand 2829 states and 9273 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:17,107 INFO L93 Difference]: Finished difference Result 2891 states and 9468 transitions. [2022-11-23 13:50:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:50:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:17,124 INFO L225 Difference]: With dead ends: 2891 [2022-11-23 13:50:17,124 INFO L226 Difference]: Without dead ends: 2891 [2022-11-23 13:50:17,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-11-23 13:50:17,126 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 214 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:17,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 8 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:50:17,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2891 states. [2022-11-23 13:50:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2891 to 2885. [2022-11-23 13:50:17,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2881 states have (on average 3.281846581048247) internal successors, (9455), 2884 states have internal predecessors, (9455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 9455 transitions. [2022-11-23 13:50:17,218 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 9455 transitions. Word has length 25 [2022-11-23 13:50:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:17,219 INFO L495 AbstractCegarLoop]: Abstraction has 2885 states and 9455 transitions. [2022-11-23 13:50:17,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 9455 transitions. [2022-11-23 13:50:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:17,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:17,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:17,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 13:50:17,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:17,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:17,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1101389971, now seen corresponding path program 1 times [2022-11-23 13:50:17,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:17,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061912545] [2022-11-23 13:50:17,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:17,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:18,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-11-23 13:50:18,256 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:18,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061912545] [2022-11-23 13:50:18,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061912545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:18,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:18,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:50:18,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085773402] [2022-11-23 13:50:18,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:18,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:50:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:50:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:50:18,259 INFO L87 Difference]: Start difference. First operand 2885 states and 9455 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:19,332 INFO L93 Difference]: Finished difference Result 2940 states and 9622 transitions. [2022-11-23 13:50:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-23 13:50:19,332 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:19,349 INFO L225 Difference]: With dead ends: 2940 [2022-11-23 13:50:19,350 INFO L226 Difference]: Without dead ends: 2940 [2022-11-23 13:50:19,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:50:19,351 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 146 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:19,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 9 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 13:50:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2022-11-23 13:50:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2934. [2022-11-23 13:50:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2934 states, 2930 states have (on average 3.2795221843003413) internal successors, (9609), 2933 states have internal predecessors, (9609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2934 states to 2934 states and 9609 transitions. [2022-11-23 13:50:19,438 INFO L78 Accepts]: Start accepts. Automaton has 2934 states and 9609 transitions. Word has length 25 [2022-11-23 13:50:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:19,439 INFO L495 AbstractCegarLoop]: Abstraction has 2934 states and 9609 transitions. [2022-11-23 13:50:19,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2934 states and 9609 transitions. [2022-11-23 13:50:19,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:19,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:19,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:19,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 13:50:19,445 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:19,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:19,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1249916594, now seen corresponding path program 2 times [2022-11-23 13:50:19,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:19,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935042897] [2022-11-23 13:50:19,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:20,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:20,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935042897] [2022-11-23 13:50:20,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935042897] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:20,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:20,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404585217] [2022-11-23 13:50:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:20,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:20,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:20,549 INFO L87 Difference]: Start difference. First operand 2934 states and 9609 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:22,272 INFO L93 Difference]: Finished difference Result 3589 states and 11731 transitions. [2022-11-23 13:50:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:50:22,273 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:22,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:22,288 INFO L225 Difference]: With dead ends: 3589 [2022-11-23 13:50:22,288 INFO L226 Difference]: Without dead ends: 3589 [2022-11-23 13:50:22,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:50:22,289 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 201 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:22,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 21 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:50:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2022-11-23 13:50:22,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3027. [2022-11-23 13:50:22,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3027 states, 3023 states have (on average 3.2795236520013233) internal successors, (9914), 3026 states have internal predecessors, (9914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:22,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3027 states to 3027 states and 9914 transitions. [2022-11-23 13:50:22,380 INFO L78 Accepts]: Start accepts. Automaton has 3027 states and 9914 transitions. Word has length 25 [2022-11-23 13:50:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:22,381 INFO L495 AbstractCegarLoop]: Abstraction has 3027 states and 9914 transitions. [2022-11-23 13:50:22,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3027 states and 9914 transitions. [2022-11-23 13:50:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:22,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:22,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:22,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 13:50:22,387 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:22,388 INFO L85 PathProgramCache]: Analyzing trace with hash 655704070, now seen corresponding path program 3 times [2022-11-23 13:50:22,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:22,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051085411] [2022-11-23 13:50:22,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:22,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:23,439 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:23,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051085411] [2022-11-23 13:50:23,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051085411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:23,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:23,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456389070] [2022-11-23 13:50:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:23,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:23,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:23,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:23,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:23,441 INFO L87 Difference]: Start difference. First operand 3027 states and 9914 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:25,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:25,132 INFO L93 Difference]: Finished difference Result 3589 states and 11739 transitions. [2022-11-23 13:50:25,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:50:25,132 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:25,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:25,146 INFO L225 Difference]: With dead ends: 3589 [2022-11-23 13:50:25,147 INFO L226 Difference]: Without dead ends: 3589 [2022-11-23 13:50:25,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:50:25,148 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 245 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:25,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 19 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:50:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3589 states. [2022-11-23 13:50:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3589 to 3090. [2022-11-23 13:50:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3090 states, 3086 states have (on average 3.2942320155541154) internal successors, (10166), 3089 states have internal predecessors, (10166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3090 states to 3090 states and 10166 transitions. [2022-11-23 13:50:25,246 INFO L78 Accepts]: Start accepts. Automaton has 3090 states and 10166 transitions. Word has length 25 [2022-11-23 13:50:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:25,247 INFO L495 AbstractCegarLoop]: Abstraction has 3090 states and 10166 transitions. [2022-11-23 13:50:25,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 3090 states and 10166 transitions. [2022-11-23 13:50:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:25,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:25,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] [2022-11-23 13:50:25,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 13:50:25,254 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash -781935672, now seen corresponding path program 4 times [2022-11-23 13:50:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:25,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032711398] [2022-11-23 13:50:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:26,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:26,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032711398] [2022-11-23 13:50:26,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032711398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:26,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:26,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:26,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326272722] [2022-11-23 13:50:26,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:26,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:26,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:26,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:26,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:26,295 INFO L87 Difference]: Start difference. First operand 3090 states and 10166 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:28,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:28,077 INFO L93 Difference]: Finished difference Result 3542 states and 11591 transitions. [2022-11-23 13:50:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:50:28,091 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:28,105 INFO L225 Difference]: With dead ends: 3542 [2022-11-23 13:50:28,105 INFO L226 Difference]: Without dead ends: 3542 [2022-11-23 13:50:28,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:50:28,107 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 223 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:28,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 27 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:50:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2022-11-23 13:50:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3291. [2022-11-23 13:50:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3287 states have (on average 3.307879525403103) internal successors, (10873), 3290 states have internal predecessors, (10873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:28,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 10873 transitions. [2022-11-23 13:50:28,205 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 10873 transitions. Word has length 25 [2022-11-23 13:50:28,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:28,206 INFO L495 AbstractCegarLoop]: Abstraction has 3291 states and 10873 transitions. [2022-11-23 13:50:28,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:28,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 10873 transitions. [2022-11-23 13:50:28,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:28,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:28,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:28,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 13:50:28,212 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:28,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:28,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1901427616, now seen corresponding path program 5 times [2022-11-23 13:50:28,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:28,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205915824] [2022-11-23 13:50:28,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:28,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:29,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:29,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205915824] [2022-11-23 13:50:29,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205915824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:29,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:29,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:29,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859731669] [2022-11-23 13:50:29,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:29,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:29,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:29,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:29,242 INFO L87 Difference]: Start difference. First operand 3291 states and 10873 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:31,427 INFO L93 Difference]: Finished difference Result 3508 states and 11408 transitions. [2022-11-23 13:50:31,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 13:50:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:31,442 INFO L225 Difference]: With dead ends: 3508 [2022-11-23 13:50:31,442 INFO L226 Difference]: Without dead ends: 3508 [2022-11-23 13:50:31,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2022-11-23 13:50:31,443 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 214 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:31,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 37 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-23 13:50:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2022-11-23 13:50:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3342. [2022-11-23 13:50:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3342 states, 3338 states have (on average 3.2828040742959854) internal successors, (10958), 3341 states have internal predecessors, (10958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3342 states to 3342 states and 10958 transitions. [2022-11-23 13:50:31,568 INFO L78 Accepts]: Start accepts. Automaton has 3342 states and 10958 transitions. Word has length 25 [2022-11-23 13:50:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:31,570 INFO L495 AbstractCegarLoop]: Abstraction has 3342 states and 10958 transitions. [2022-11-23 13:50:31,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:31,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3342 states and 10958 transitions. [2022-11-23 13:50:31,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:31,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:31,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:31,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 13:50:31,577 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash -167623114, now seen corresponding path program 6 times [2022-11-23 13:50:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969991476] [2022-11-23 13:50:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:31,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:32,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:32,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969991476] [2022-11-23 13:50:32,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969991476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:32,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:32,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:32,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046296021] [2022-11-23 13:50:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:32,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:32,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:32,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:32,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:32,774 INFO L87 Difference]: Start difference. First operand 3342 states and 10958 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:34,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:34,624 INFO L93 Difference]: Finished difference Result 3547 states and 11538 transitions. [2022-11-23 13:50:34,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:50:34,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:34,636 INFO L225 Difference]: With dead ends: 3547 [2022-11-23 13:50:34,636 INFO L226 Difference]: Without dead ends: 3547 [2022-11-23 13:50:34,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=438, Unknown=0, NotChecked=0, Total=650 [2022-11-23 13:50:34,637 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 246 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:34,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 33 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:50:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3547 states. [2022-11-23 13:50:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3547 to 3468. [2022-11-23 13:50:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 3464 states have (on average 3.277713625866051) internal successors, (11354), 3467 states have internal predecessors, (11354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 11354 transitions. [2022-11-23 13:50:34,727 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 11354 transitions. Word has length 25 [2022-11-23 13:50:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:34,728 INFO L495 AbstractCegarLoop]: Abstraction has 3468 states and 11354 transitions. [2022-11-23 13:50:34,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 11354 transitions. [2022-11-23 13:50:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:34,734 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:34,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:34,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 13:50:34,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2095322411, now seen corresponding path program 2 times [2022-11-23 13:50:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242421642] [2022-11-23 13:50:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:35,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:35,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242421642] [2022-11-23 13:50:35,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242421642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:35,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:35,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:50:35,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930828998] [2022-11-23 13:50:35,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:35,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:50:35,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:35,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:50:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:50:35,558 INFO L87 Difference]: Start difference. First operand 3468 states and 11354 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:36,951 INFO L93 Difference]: Finished difference Result 4005 states and 13093 transitions. [2022-11-23 13:50:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 13:50:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:36,966 INFO L225 Difference]: With dead ends: 4005 [2022-11-23 13:50:36,967 INFO L226 Difference]: Without dead ends: 4005 [2022-11-23 13:50:36,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2022-11-23 13:50:36,968 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 187 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:36,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 15 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 13:50:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2022-11-23 13:50:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 3525. [2022-11-23 13:50:37,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 3521 states have (on average 3.2891224084067026) internal successors, (11581), 3524 states have internal predecessors, (11581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 11581 transitions. [2022-11-23 13:50:37,099 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 11581 transitions. Word has length 25 [2022-11-23 13:50:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:37,099 INFO L495 AbstractCegarLoop]: Abstraction has 3525 states and 11581 transitions. [2022-11-23 13:50:37,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:37,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 11581 transitions. [2022-11-23 13:50:37,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:37,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:37,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:37,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 13:50:37,108 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -757033655, now seen corresponding path program 3 times [2022-11-23 13:50:37,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:37,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394783498] [2022-11-23 13:50:37,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:37,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:37,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:38,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-11-23 13:50:38,018 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:38,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394783498] [2022-11-23 13:50:38,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394783498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:38,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:38,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 13:50:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681917521] [2022-11-23 13:50:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:38,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:50:38,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:50:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:50:38,019 INFO L87 Difference]: Start difference. First operand 3525 states and 11581 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:39,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:39,203 INFO L93 Difference]: Finished difference Result 3955 states and 12936 transitions. [2022-11-23 13:50:39,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:50:39,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:39,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:39,211 INFO L225 Difference]: With dead ends: 3955 [2022-11-23 13:50:39,211 INFO L226 Difference]: Without dead ends: 3955 [2022-11-23 13:50:39,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:50:39,212 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 180 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:39,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 19 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:50:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2022-11-23 13:50:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3776. [2022-11-23 13:50:39,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3772 states have (on average 3.2979851537645812) internal successors, (12440), 3775 states have internal predecessors, (12440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 12440 transitions. [2022-11-23 13:50:39,310 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 12440 transitions. Word has length 25 [2022-11-23 13:50:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:39,310 INFO L495 AbstractCegarLoop]: Abstraction has 3776 states and 12440 transitions. [2022-11-23 13:50:39,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 12440 transitions. [2022-11-23 13:50:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:39,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:39,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:39,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 13:50:39,318 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash 941576157, now seen corresponding path program 4 times [2022-11-23 13:50:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:39,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326602409] [2022-11-23 13:50:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:40,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-11-23 13:50:40,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:40,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326602409] [2022-11-23 13:50:40,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326602409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:40,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:40,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:50:40,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572637125] [2022-11-23 13:50:40,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:40,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:50:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:40,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:50:40,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:50:40,196 INFO L87 Difference]: Start difference. First operand 3776 states and 12440 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:41,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:41,924 INFO L93 Difference]: Finished difference Result 3997 states and 12938 transitions. [2022-11-23 13:50:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-23 13:50:41,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:41,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:41,932 INFO L225 Difference]: With dead ends: 3997 [2022-11-23 13:50:41,933 INFO L226 Difference]: Without dead ends: 3997 [2022-11-23 13:50:41,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:50:41,933 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 174 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:41,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 32 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:50:41,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2022-11-23 13:50:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3833. [2022-11-23 13:50:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3829 states have (on average 3.2616871245756074) internal successors, (12489), 3832 states have internal predecessors, (12489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 12489 transitions. [2022-11-23 13:50:42,027 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 12489 transitions. Word has length 25 [2022-11-23 13:50:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:42,027 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 12489 transitions. [2022-11-23 13:50:42,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 12489 transitions. [2022-11-23 13:50:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:42,034 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:42,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:42,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 13:50:42,034 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 99351715, now seen corresponding path program 5 times [2022-11-23 13:50:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:42,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772164691] [2022-11-23 13:50:42,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:42,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:43,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:43,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772164691] [2022-11-23 13:50:43,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772164691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:43,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:43,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:50:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171797930] [2022-11-23 13:50:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:43,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:50:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:50:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:50:43,136 INFO L87 Difference]: Start difference. First operand 3833 states and 12489 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:44,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:44,489 INFO L93 Difference]: Finished difference Result 4096 states and 13249 transitions. [2022-11-23 13:50:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:50:44,490 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:44,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:44,500 INFO L225 Difference]: With dead ends: 4096 [2022-11-23 13:50:44,500 INFO L226 Difference]: Without dead ends: 4096 [2022-11-23 13:50:44,501 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:50:44,501 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 191 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:44,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 25 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 13:50:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2022-11-23 13:50:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 3879. [2022-11-23 13:50:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 3875 states have (on average 3.2601290322580647) internal successors, (12633), 3878 states have internal predecessors, (12633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 12633 transitions. [2022-11-23 13:50:44,597 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 12633 transitions. Word has length 25 [2022-11-23 13:50:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:44,598 INFO L495 AbstractCegarLoop]: Abstraction has 3879 states and 12633 transitions. [2022-11-23 13:50:44,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 12633 transitions. [2022-11-23 13:50:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:44,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:44,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:44,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 13:50:44,604 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:44,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:44,605 INFO L85 PathProgramCache]: Analyzing trace with hash 6650944, now seen corresponding path program 7 times [2022-11-23 13:50:44,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:44,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248125414] [2022-11-23 13:50:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:45,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:45,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:45,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248125414] [2022-11-23 13:50:45,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248125414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:45,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:45,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:45,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125480276] [2022-11-23 13:50:45,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:45,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:45,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:45,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:45,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:45,636 INFO L87 Difference]: Start difference. First operand 3879 states and 12633 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:47,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:47,361 INFO L93 Difference]: Finished difference Result 4625 states and 15115 transitions. [2022-11-23 13:50:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:50:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:47,370 INFO L225 Difference]: With dead ends: 4625 [2022-11-23 13:50:47,370 INFO L226 Difference]: Without dead ends: 4625 [2022-11-23 13:50:47,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2022-11-23 13:50:47,371 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 247 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:47,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 43 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:50:47,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2022-11-23 13:50:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 4493. [2022-11-23 13:50:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4493 states, 4489 states have (on average 3.2740031187346847) internal successors, (14697), 4492 states have internal predecessors, (14697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4493 states to 4493 states and 14697 transitions. [2022-11-23 13:50:47,517 INFO L78 Accepts]: Start accepts. Automaton has 4493 states and 14697 transitions. Word has length 25 [2022-11-23 13:50:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:47,517 INFO L495 AbstractCegarLoop]: Abstraction has 4493 states and 14697 transitions. [2022-11-23 13:50:47,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4493 states and 14697 transitions. [2022-11-23 13:50:47,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:47,524 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:47,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:47,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 13:50:47,525 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:47,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:47,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1740455446, now seen corresponding path program 8 times [2022-11-23 13:50:47,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:47,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103552874] [2022-11-23 13:50:47,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:48,432 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103552874] [2022-11-23 13:50:48,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103552874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:48,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:48,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126197927] [2022-11-23 13:50:48,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:48,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:48,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:48,433 INFO L87 Difference]: Start difference. First operand 4493 states and 14697 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:51,017 INFO L93 Difference]: Finished difference Result 5243 states and 16977 transitions. [2022-11-23 13:50:51,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:50:51,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:51,027 INFO L225 Difference]: With dead ends: 5243 [2022-11-23 13:50:51,027 INFO L226 Difference]: Without dead ends: 5243 [2022-11-23 13:50:51,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=637, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:50:51,028 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 248 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:51,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 63 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:50:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5243 states. [2022-11-23 13:50:51,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5243 to 4199. [2022-11-23 13:50:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4199 states, 4195 states have (on average 3.292729439809297) internal successors, (13813), 4198 states have internal predecessors, (13813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4199 states to 4199 states and 13813 transitions. [2022-11-23 13:50:51,135 INFO L78 Accepts]: Start accepts. Automaton has 4199 states and 13813 transitions. Word has length 25 [2022-11-23 13:50:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:51,135 INFO L495 AbstractCegarLoop]: Abstraction has 4199 states and 13813 transitions. [2022-11-23 13:50:51,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 4199 states and 13813 transitions. [2022-11-23 13:50:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:51,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:51,142 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:51,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 13:50:51,143 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:51,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:51,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2035141466, now seen corresponding path program 9 times [2022-11-23 13:50:51,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985023536] [2022-11-23 13:50:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:51,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-11-23 13:50:51,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:51,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985023536] [2022-11-23 13:50:51,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985023536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:51,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:51,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:50:51,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375748526] [2022-11-23 13:50:51,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:51,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:50:51,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:51,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:50:51,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:50:51,993 INFO L87 Difference]: Start difference. First operand 4199 states and 13813 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:53,337 INFO L93 Difference]: Finished difference Result 4333 states and 13990 transitions. [2022-11-23 13:50:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-23 13:50:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:53,349 INFO L225 Difference]: With dead ends: 4333 [2022-11-23 13:50:53,349 INFO L226 Difference]: Without dead ends: 4333 [2022-11-23 13:50:53,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:50:53,350 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 224 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:53,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 45 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:50:53,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2022-11-23 13:50:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 4213. [2022-11-23 13:50:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 4209 states have (on average 3.2335471608458066) internal successors, (13610), 4212 states have internal predecessors, (13610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 13610 transitions. [2022-11-23 13:50:53,456 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 13610 transitions. Word has length 25 [2022-11-23 13:50:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:53,456 INFO L495 AbstractCegarLoop]: Abstraction has 4213 states and 13610 transitions. [2022-11-23 13:50:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 13610 transitions. [2022-11-23 13:50:53,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:53,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:53,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 13:50:53,464 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -526021328, now seen corresponding path program 10 times [2022-11-23 13:50:53,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2677151] [2022-11-23 13:50:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:54,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-11-23 13:50:54,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:54,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2677151] [2022-11-23 13:50:54,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2677151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:54,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:54,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:50:54,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615994716] [2022-11-23 13:50:54,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:54,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:50:54,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:54,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:50:54,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:50:54,374 INFO L87 Difference]: Start difference. First operand 4213 states and 13610 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:57,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:57,360 INFO L93 Difference]: Finished difference Result 4997 states and 15994 transitions. [2022-11-23 13:50:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:50:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:57,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:57,369 INFO L225 Difference]: With dead ends: 4997 [2022-11-23 13:50:57,369 INFO L226 Difference]: Without dead ends: 4997 [2022-11-23 13:50:57,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=305, Invalid=687, Unknown=0, NotChecked=0, Total=992 [2022-11-23 13:50:57,371 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 192 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:57,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 73 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:50:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4997 states. [2022-11-23 13:50:57,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4997 to 3473. [2022-11-23 13:50:57,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3473 states, 3469 states have (on average 3.237244162582877) internal successors, (11230), 3472 states have internal predecessors, (11230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3473 states to 3473 states and 11230 transitions. [2022-11-23 13:50:57,467 INFO L78 Accepts]: Start accepts. Automaton has 3473 states and 11230 transitions. Word has length 25 [2022-11-23 13:50:57,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:57,467 INFO L495 AbstractCegarLoop]: Abstraction has 3473 states and 11230 transitions. [2022-11-23 13:50:57,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 3473 states and 11230 transitions. [2022-11-23 13:50:57,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:57,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:57,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:57,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-23 13:50:57,473 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:57,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1280311155, now seen corresponding path program 6 times [2022-11-23 13:50:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:57,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085434944] [2022-11-23 13:50:57,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:57,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:50:58,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:50:58,497 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:50:58,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085434944] [2022-11-23 13:50:58,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085434944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:50:58,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:50:58,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 13:50:58,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075574598] [2022-11-23 13:50:58,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:50:58,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 13:50:58,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:50:58,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 13:50:58,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-23 13:50:58,499 INFO L87 Difference]: Start difference. First operand 3473 states and 11230 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:59,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:50:59,572 INFO L93 Difference]: Finished difference Result 3603 states and 11566 transitions. [2022-11-23 13:50:59,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 13:50:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:50:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:50:59,583 INFO L225 Difference]: With dead ends: 3603 [2022-11-23 13:50:59,583 INFO L226 Difference]: Without dead ends: 3603 [2022-11-23 13:50:59,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-11-23 13:50:59,584 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 116 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:50:59,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 21 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-23 13:50:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2022-11-23 13:50:59,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3501. [2022-11-23 13:50:59,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 3497 states have (on average 3.235344581069488) internal successors, (11314), 3500 states have internal predecessors, (11314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:59,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 11314 transitions. [2022-11-23 13:50:59,654 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 11314 transitions. Word has length 25 [2022-11-23 13:50:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:50:59,654 INFO L495 AbstractCegarLoop]: Abstraction has 3501 states and 11314 transitions. [2022-11-23 13:50:59,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:50:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 11314 transitions. [2022-11-23 13:50:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:50:59,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:50:59,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:50:59,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-23 13:50:59,660 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:50:59,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:50:59,661 INFO L85 PathProgramCache]: Analyzing trace with hash 57977601, now seen corresponding path program 7 times [2022-11-23 13:50:59,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:50:59,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770859441] [2022-11-23 13:50:59,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:50:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:50:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:00,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:00,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:00,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770859441] [2022-11-23 13:51:00,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770859441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:00,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:00,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:51:00,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887863281] [2022-11-23 13:51:00,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:00,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:51:00,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:00,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:51:00,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:51:00,445 INFO L87 Difference]: Start difference. First operand 3501 states and 11314 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:01,696 INFO L93 Difference]: Finished difference Result 3869 states and 12430 transitions. [2022-11-23 13:51:01,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-23 13:51:01,697 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:01,704 INFO L225 Difference]: With dead ends: 3869 [2022-11-23 13:51:01,704 INFO L226 Difference]: Without dead ends: 3869 [2022-11-23 13:51:01,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:51:01,705 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 151 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1071 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:01,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 27 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1071 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-23 13:51:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3869 states. [2022-11-23 13:51:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3869 to 3739. [2022-11-23 13:51:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3739 states, 3735 states have (on average 3.2396251673360106) internal successors, (12100), 3738 states have internal predecessors, (12100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 12100 transitions. [2022-11-23 13:51:01,786 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 12100 transitions. Word has length 25 [2022-11-23 13:51:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:01,786 INFO L495 AbstractCegarLoop]: Abstraction has 3739 states and 12100 transitions. [2022-11-23 13:51:01,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 12100 transitions. [2022-11-23 13:51:01,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:01,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:01,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:01,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-23 13:51:01,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:01,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:01,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1756587413, now seen corresponding path program 8 times [2022-11-23 13:51:01,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:01,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879017905] [2022-11-23 13:51:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:01,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:02,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:02,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879017905] [2022-11-23 13:51:02,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879017905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:02,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:02,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:51:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452023825] [2022-11-23 13:51:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:02,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:51:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:51:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:51:02,550 INFO L87 Difference]: Start difference. First operand 3739 states and 12100 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:04,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:04,144 INFO L93 Difference]: Finished difference Result 3897 states and 12448 transitions. [2022-11-23 13:51:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:51:04,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:04,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:04,151 INFO L225 Difference]: With dead ends: 3897 [2022-11-23 13:51:04,151 INFO L226 Difference]: Without dead ends: 3897 [2022-11-23 13:51:04,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:51:04,152 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 195 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:04,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 41 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-23 13:51:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3897 states. [2022-11-23 13:51:04,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3897 to 3795. [2022-11-23 13:51:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3795 states, 3791 states have (on average 3.2176206805592193) internal successors, (12198), 3794 states have internal predecessors, (12198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3795 states to 3795 states and 12198 transitions. [2022-11-23 13:51:04,250 INFO L78 Accepts]: Start accepts. Automaton has 3795 states and 12198 transitions. Word has length 25 [2022-11-23 13:51:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:04,250 INFO L495 AbstractCegarLoop]: Abstraction has 3795 states and 12198 transitions. [2022-11-23 13:51:04,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3795 states and 12198 transitions. [2022-11-23 13:51:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:04,256 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:04,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:04,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-23 13:51:04,257 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:04,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 914362971, now seen corresponding path program 9 times [2022-11-23 13:51:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:04,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394660505] [2022-11-23 13:51:04,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:05,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:05,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394660505] [2022-11-23 13:51:05,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394660505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:05,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:05,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 13:51:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355171934] [2022-11-23 13:51:05,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:05,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-23 13:51:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:05,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-23 13:51:05,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-23 13:51:05,087 INFO L87 Difference]: Start difference. First operand 3795 states and 12198 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:06,687 INFO L93 Difference]: Finished difference Result 4513 states and 14306 transitions. [2022-11-23 13:51:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-23 13:51:06,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:06,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:06,695 INFO L225 Difference]: With dead ends: 4513 [2022-11-23 13:51:06,695 INFO L226 Difference]: Without dead ends: 4513 [2022-11-23 13:51:06,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=198, Invalid=402, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:51:06,696 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 249 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:06,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 36 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:51:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4513 states. [2022-11-23 13:51:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4513 to 3403. [2022-11-23 13:51:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3403 states, 3399 states have (on average 3.2244777875845836) internal successors, (10960), 3402 states have internal predecessors, (10960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3403 states to 3403 states and 10960 transitions. [2022-11-23 13:51:06,751 INFO L78 Accepts]: Start accepts. Automaton has 3403 states and 10960 transitions. Word has length 25 [2022-11-23 13:51:06,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:06,751 INFO L495 AbstractCegarLoop]: Abstraction has 3403 states and 10960 transitions. [2022-11-23 13:51:06,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3403 states and 10960 transitions. [2022-11-23 13:51:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:06,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:06,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:06,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-23 13:51:06,754 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:06,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash -316824037, now seen corresponding path program 10 times [2022-11-23 13:51:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:06,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741988876] [2022-11-23 13:51:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:07,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741988876] [2022-11-23 13:51:07,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741988876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:07,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:07,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-23 13:51:07,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211632415] [2022-11-23 13:51:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:07,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-23 13:51:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-23 13:51:07,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-23 13:51:07,409 INFO L87 Difference]: Start difference. First operand 3403 states and 10960 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:08,244 INFO L93 Difference]: Finished difference Result 3438 states and 11069 transitions. [2022-11-23 13:51:08,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 13:51:08,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:08,251 INFO L225 Difference]: With dead ends: 3438 [2022-11-23 13:51:08,251 INFO L226 Difference]: Without dead ends: 3438 [2022-11-23 13:51:08,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:08,253 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 126 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:08,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 19 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 13:51:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2022-11-23 13:51:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3410. [2022-11-23 13:51:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 3406 states have (on average 3.2240164415736934) internal successors, (10981), 3409 states have internal predecessors, (10981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:08,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 10981 transitions. [2022-11-23 13:51:08,303 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 10981 transitions. Word has length 25 [2022-11-23 13:51:08,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:08,303 INFO L495 AbstractCegarLoop]: Abstraction has 3410 states and 10981 transitions. [2022-11-23 13:51:08,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 10981 transitions. [2022-11-23 13:51:08,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:08,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:08,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:08,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-23 13:51:08,307 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:08,307 INFO L85 PathProgramCache]: Analyzing trace with hash -803450171, now seen corresponding path program 11 times [2022-11-23 13:51:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:08,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719550166] [2022-11-23 13:51:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:09,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:09,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719550166] [2022-11-23 13:51:09,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719550166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:09,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:09,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:51:09,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452013995] [2022-11-23 13:51:09,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:09,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:51:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:51:09,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:51:09,111 INFO L87 Difference]: Start difference. First operand 3410 states and 10981 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:10,666 INFO L93 Difference]: Finished difference Result 3508 states and 11202 transitions. [2022-11-23 13:51:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:51:10,667 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:10,673 INFO L225 Difference]: With dead ends: 3508 [2022-11-23 13:51:10,673 INFO L226 Difference]: Without dead ends: 3508 [2022-11-23 13:51:10,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=357, Unknown=0, NotChecked=0, Total=506 [2022-11-23 13:51:10,674 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 195 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:10,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 42 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:51:10,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2022-11-23 13:51:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3494. [2022-11-23 13:51:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 3490 states have (on average 3.197134670487106) internal successors, (11158), 3493 states have internal predecessors, (11158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 11158 transitions. [2022-11-23 13:51:10,724 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 11158 transitions. Word has length 25 [2022-11-23 13:51:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:10,724 INFO L495 AbstractCegarLoop]: Abstraction has 3494 states and 11158 transitions. [2022-11-23 13:51:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 11158 transitions. [2022-11-23 13:51:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:10,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:10,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:10,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-23 13:51:10,728 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1645674613, now seen corresponding path program 12 times [2022-11-23 13:51:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:10,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674515338] [2022-11-23 13:51:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:11,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-11-23 13:51:11,690 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:11,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674515338] [2022-11-23 13:51:11,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674515338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:11,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:11,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:51:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789393345] [2022-11-23 13:51:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:11,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:51:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:11,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:51:11,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:51:11,691 INFO L87 Difference]: Start difference. First operand 3494 states and 11158 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:13,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:13,888 INFO L93 Difference]: Finished difference Result 4152 states and 13146 transitions. [2022-11-23 13:51:13,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:13,889 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:13,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:13,896 INFO L225 Difference]: With dead ends: 4152 [2022-11-23 13:51:13,896 INFO L226 Difference]: Without dead ends: 4152 [2022-11-23 13:51:13,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=601, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:51:13,897 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 182 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:13,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 49 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 13:51:13,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2022-11-23 13:51:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3193. [2022-11-23 13:51:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3193 states, 3189 states have (on average 3.2151144559423015) internal successors, (10253), 3192 states have internal predecessors, (10253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:13,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3193 states to 3193 states and 10253 transitions. [2022-11-23 13:51:13,948 INFO L78 Accepts]: Start accepts. Automaton has 3193 states and 10253 transitions. Word has length 25 [2022-11-23 13:51:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:13,948 INFO L495 AbstractCegarLoop]: Abstraction has 3193 states and 10253 transitions. [2022-11-23 13:51:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3193 states and 10253 transitions. [2022-11-23 13:51:13,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-23 13:51:13,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:13,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:13,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-23 13:51:13,952 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:13,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1527233341, now seen corresponding path program 13 times [2022-11-23 13:51:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:13,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342838386] [2022-11-23 13:51:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:13,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:14,904 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:14,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342838386] [2022-11-23 13:51:14,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342838386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:14,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:14,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:51:14,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732730754] [2022-11-23 13:51:14,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:14,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:51:14,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:14,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:51:14,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:51:14,906 INFO L87 Difference]: Start difference. First operand 3193 states and 10253 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:16,660 INFO L93 Difference]: Finished difference Result 3977 states and 12637 transitions. [2022-11-23 13:51:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 13:51:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-23 13:51:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:16,668 INFO L225 Difference]: With dead ends: 3977 [2022-11-23 13:51:16,668 INFO L226 Difference]: Without dead ends: 3977 [2022-11-23 13:51:16,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2022-11-23 13:51:16,669 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 236 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:16,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 41 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-23 13:51:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2022-11-23 13:51:16,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3137. [2022-11-23 13:51:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3137 states, 3133 states have (on average 3.219597829556336) internal successors, (10087), 3136 states have internal predecessors, (10087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3137 states to 3137 states and 10087 transitions. [2022-11-23 13:51:16,719 INFO L78 Accepts]: Start accepts. Automaton has 3137 states and 10087 transitions. Word has length 25 [2022-11-23 13:51:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:16,720 INFO L495 AbstractCegarLoop]: Abstraction has 3137 states and 10087 transitions. [2022-11-23 13:51:16,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3137 states and 10087 transitions. [2022-11-23 13:51:16,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:16,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:16,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:16,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-23 13:51:16,722 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:16,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:16,723 INFO L85 PathProgramCache]: Analyzing trace with hash 2121425760, now seen corresponding path program 1 times [2022-11-23 13:51:16,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:16,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383982292] [2022-11-23 13:51:16,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:16,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:17,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-11-23 13:51:17,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:17,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383982292] [2022-11-23 13:51:17,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383982292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:17,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:17,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:17,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802694057] [2022-11-23 13:51:17,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:17,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:17,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:17,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:17,685 INFO L87 Difference]: Start difference. First operand 3137 states and 10087 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:19,879 INFO L93 Difference]: Finished difference Result 4673 states and 15238 transitions. [2022-11-23 13:51:19,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:19,879 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:19,888 INFO L225 Difference]: With dead ends: 4673 [2022-11-23 13:51:19,888 INFO L226 Difference]: Without dead ends: 4673 [2022-11-23 13:51:19,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:51:19,889 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 316 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:19,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 30 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:51:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2022-11-23 13:51:19,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 3627. [2022-11-23 13:51:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3627 states, 3623 states have (on average 3.2299199558377034) internal successors, (11702), 3626 states have internal predecessors, (11702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 11702 transitions. [2022-11-23 13:51:19,950 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 11702 transitions. Word has length 27 [2022-11-23 13:51:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:19,950 INFO L495 AbstractCegarLoop]: Abstraction has 3627 states and 11702 transitions. [2022-11-23 13:51:19,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 11702 transitions. [2022-11-23 13:51:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:19,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:19,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:19,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-23 13:51:19,953 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash -189874740, now seen corresponding path program 1 times [2022-11-23 13:51:19,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:19,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241639142] [2022-11-23 13:51:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:19,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:21,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:21,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241639142] [2022-11-23 13:51:21,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241639142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:21,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:21,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353964703] [2022-11-23 13:51:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:21,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:21,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:21,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:21,061 INFO L87 Difference]: Start difference. First operand 3627 states and 11702 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:23,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:23,130 INFO L93 Difference]: Finished difference Result 5135 states and 16771 transitions. [2022-11-23 13:51:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:23,130 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:23,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:23,139 INFO L225 Difference]: With dead ends: 5135 [2022-11-23 13:51:23,140 INFO L226 Difference]: Without dead ends: 5135 [2022-11-23 13:51:23,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:23,141 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 281 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:23,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 28 Invalid, 2036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:51:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5135 states. [2022-11-23 13:51:23,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5135 to 3790. [2022-11-23 13:51:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3786 states have (on average 3.2271526677231908) internal successors, (12218), 3789 states have internal predecessors, (12218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 12218 transitions. [2022-11-23 13:51:23,208 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 12218 transitions. Word has length 27 [2022-11-23 13:51:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:23,208 INFO L495 AbstractCegarLoop]: Abstraction has 3790 states and 12218 transitions. [2022-11-23 13:51:23,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:23,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 12218 transitions. [2022-11-23 13:51:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:23,211 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:23,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:23,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-23 13:51:23,212 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:23,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:23,212 INFO L85 PathProgramCache]: Analyzing trace with hash 807546932, now seen corresponding path program 2 times [2022-11-23 13:51:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401071032] [2022-11-23 13:51:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:24,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:24,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401071032] [2022-11-23 13:51:24,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401071032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:24,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:24,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:24,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182423472] [2022-11-23 13:51:24,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:24,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:24,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:24,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:24,227 INFO L87 Difference]: Start difference. First operand 3790 states and 12218 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:26,676 INFO L93 Difference]: Finished difference Result 6544 states and 21200 transitions. [2022-11-23 13:51:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:26,689 INFO L225 Difference]: With dead ends: 6544 [2022-11-23 13:51:26,689 INFO L226 Difference]: Without dead ends: 6544 [2022-11-23 13:51:26,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:51:26,690 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 348 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:26,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 42 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:51:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6544 states. [2022-11-23 13:51:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6544 to 3925. [2022-11-23 13:51:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3925 states, 3921 states have (on average 3.219331803111451) internal successors, (12623), 3924 states have internal predecessors, (12623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 12623 transitions. [2022-11-23 13:51:26,773 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 12623 transitions. Word has length 27 [2022-11-23 13:51:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:26,774 INFO L495 AbstractCegarLoop]: Abstraction has 3925 states and 12623 transitions. [2022-11-23 13:51:26,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 12623 transitions. [2022-11-23 13:51:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:26,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:26,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:26,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-23 13:51:26,779 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:26,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1842030356, now seen corresponding path program 3 times [2022-11-23 13:51:26,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:26,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049367642] [2022-11-23 13:51:26,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:26,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:27,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:27,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049367642] [2022-11-23 13:51:27,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049367642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:27,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:27,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:27,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490786413] [2022-11-23 13:51:27,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:27,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:27,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:27,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:27,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:27,920 INFO L87 Difference]: Start difference. First operand 3925 states and 12623 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:30,444 INFO L93 Difference]: Finished difference Result 6576 states and 21296 transitions. [2022-11-23 13:51:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:30,457 INFO L225 Difference]: With dead ends: 6576 [2022-11-23 13:51:30,457 INFO L226 Difference]: Without dead ends: 6576 [2022-11-23 13:51:30,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:51:30,458 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 321 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2439 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:30,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 49 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2439 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 13:51:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6576 states. [2022-11-23 13:51:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6576 to 3988. [2022-11-23 13:51:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3988 states, 3984 states have (on average 3.215863453815261) internal successors, (12812), 3987 states have internal predecessors, (12812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:30,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3988 states to 3988 states and 12812 transitions. [2022-11-23 13:51:30,562 INFO L78 Accepts]: Start accepts. Automaton has 3988 states and 12812 transitions. Word has length 27 [2022-11-23 13:51:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:30,562 INFO L495 AbstractCegarLoop]: Abstraction has 3988 states and 12812 transitions. [2022-11-23 13:51:30,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3988 states and 12812 transitions. [2022-11-23 13:51:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:30,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:30,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:30,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-23 13:51:30,567 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:30,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:30,567 INFO L85 PathProgramCache]: Analyzing trace with hash -434353106, now seen corresponding path program 4 times [2022-11-23 13:51:30,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:30,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60930261] [2022-11-23 13:51:30,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:30,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:31,757 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60930261] [2022-11-23 13:51:31,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60930261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:31,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:31,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85638472] [2022-11-23 13:51:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:31,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:31,759 INFO L87 Difference]: Start difference. First operand 3988 states and 12812 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:34,205 INFO L93 Difference]: Finished difference Result 6432 states and 20864 transitions. [2022-11-23 13:51:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:34,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:34,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:34,219 INFO L225 Difference]: With dead ends: 6432 [2022-11-23 13:51:34,219 INFO L226 Difference]: Without dead ends: 6432 [2022-11-23 13:51:34,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:51:34,219 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 350 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:34,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 55 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 13:51:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2022-11-23 13:51:34,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 4177. [2022-11-23 13:51:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4177 states, 4173 states have (on average 3.206086748142823) internal successors, (13379), 4176 states have internal predecessors, (13379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:34,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 13379 transitions. [2022-11-23 13:51:34,306 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 13379 transitions. Word has length 27 [2022-11-23 13:51:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:34,307 INFO L495 AbstractCegarLoop]: Abstraction has 4177 states and 13379 transitions. [2022-11-23 13:51:34,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 13379 transitions. [2022-11-23 13:51:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:34,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:34,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:34,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-23 13:51:34,313 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:34,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1770680006, now seen corresponding path program 5 times [2022-11-23 13:51:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:34,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932758231] [2022-11-23 13:51:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:35,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:35,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932758231] [2022-11-23 13:51:35,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932758231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:35,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:35,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:35,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021678442] [2022-11-23 13:51:35,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:35,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:35,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:35,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:35,365 INFO L87 Difference]: Start difference. First operand 4177 states and 13379 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:37,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:37,512 INFO L93 Difference]: Finished difference Result 6568 states and 21373 transitions. [2022-11-23 13:51:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:37,513 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:37,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:37,526 INFO L225 Difference]: With dead ends: 6568 [2022-11-23 13:51:37,526 INFO L226 Difference]: Without dead ends: 6568 [2022-11-23 13:51:37,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:37,527 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 427 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:37,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 77 Invalid, 2251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:51:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6568 states. [2022-11-23 13:51:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6568 to 4708. [2022-11-23 13:51:37,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4708 states, 4704 states have (on average 3.2100340136054424) internal successors, (15100), 4707 states have internal predecessors, (15100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4708 states to 4708 states and 15100 transitions. [2022-11-23 13:51:37,606 INFO L78 Accepts]: Start accepts. Automaton has 4708 states and 15100 transitions. Word has length 27 [2022-11-23 13:51:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:37,607 INFO L495 AbstractCegarLoop]: Abstraction has 4708 states and 15100 transitions. [2022-11-23 13:51:37,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:37,607 INFO L276 IsEmpty]: Start isEmpty. Operand 4708 states and 15100 transitions. [2022-11-23 13:51:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:37,611 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:37,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-23 13:51:37,611 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1876209868, now seen corresponding path program 2 times [2022-11-23 13:51:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:37,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765215367] [2022-11-23 13:51:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:37,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:38,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:38,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765215367] [2022-11-23 13:51:38,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765215367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:38,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:38,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:38,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130327589] [2022-11-23 13:51:38,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:38,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:38,715 INFO L87 Difference]: Start difference. First operand 4708 states and 15100 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:40,980 INFO L93 Difference]: Finished difference Result 7305 states and 23611 transitions. [2022-11-23 13:51:40,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:40,980 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:40,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:40,994 INFO L225 Difference]: With dead ends: 7305 [2022-11-23 13:51:40,994 INFO L226 Difference]: Without dead ends: 7305 [2022-11-23 13:51:40,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:40,995 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 267 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:40,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 40 Invalid, 2323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:51:41,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2022-11-23 13:51:41,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 4705. [2022-11-23 13:51:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4705 states, 4701 states have (on average 3.2101680493512017) internal successors, (15091), 4704 states have internal predecessors, (15091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 15091 transitions. [2022-11-23 13:51:41,085 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 15091 transitions. Word has length 27 [2022-11-23 13:51:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:41,085 INFO L495 AbstractCegarLoop]: Abstraction has 4705 states and 15091 transitions. [2022-11-23 13:51:41,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:41,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 15091 transitions. [2022-11-23 13:51:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:41,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:41,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:41,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-23 13:51:41,090 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 24063144, now seen corresponding path program 3 times [2022-11-23 13:51:41,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:41,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530409118] [2022-11-23 13:51:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:42,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:42,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530409118] [2022-11-23 13:51:42,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530409118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:42,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:42,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:42,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156910256] [2022-11-23 13:51:42,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:42,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:42,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:42,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:42,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:42,318 INFO L87 Difference]: Start difference. First operand 4705 states and 15091 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:44,588 INFO L93 Difference]: Finished difference Result 7239 states and 23481 transitions. [2022-11-23 13:51:44,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:44,589 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:44,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:44,603 INFO L225 Difference]: With dead ends: 7239 [2022-11-23 13:51:44,603 INFO L226 Difference]: Without dead ends: 7239 [2022-11-23 13:51:44,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:44,604 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 274 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 2387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:44,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 48 Invalid, 2387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:51:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2022-11-23 13:51:44,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 5384. [2022-11-23 13:51:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 5380 states have (on average 3.2276951672862455) internal successors, (17365), 5383 states have internal predecessors, (17365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 17365 transitions. [2022-11-23 13:51:44,693 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 17365 transitions. Word has length 27 [2022-11-23 13:51:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:44,694 INFO L495 AbstractCegarLoop]: Abstraction has 5384 states and 17365 transitions. [2022-11-23 13:51:44,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:44,694 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 17365 transitions. [2022-11-23 13:51:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:44,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:44,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:44,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-23 13:51:44,699 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 24063145, now seen corresponding path program 1 times [2022-11-23 13:51:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:44,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754948892] [2022-11-23 13:51:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:45,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-11-23 13:51:45,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:45,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754948892] [2022-11-23 13:51:45,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754948892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:45,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:45,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:45,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924161093] [2022-11-23 13:51:45,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:45,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:45,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:45,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:45,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:45,989 INFO L87 Difference]: Start difference. First operand 5384 states and 17365 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:48,196 INFO L93 Difference]: Finished difference Result 7149 states and 23143 transitions. [2022-11-23 13:51:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:48,196 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:48,210 INFO L225 Difference]: With dead ends: 7149 [2022-11-23 13:51:48,210 INFO L226 Difference]: Without dead ends: 7149 [2022-11-23 13:51:48,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:48,211 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 314 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:48,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 45 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2214 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:51:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7149 states. [2022-11-23 13:51:48,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7149 to 4876. [2022-11-23 13:51:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4876 states, 4872 states have (on average 3.202791461412151) internal successors, (15604), 4875 states have internal predecessors, (15604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4876 states to 4876 states and 15604 transitions. [2022-11-23 13:51:48,301 INFO L78 Accepts]: Start accepts. Automaton has 4876 states and 15604 transitions. Word has length 27 [2022-11-23 13:51:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:48,301 INFO L495 AbstractCegarLoop]: Abstraction has 4876 states and 15604 transitions. [2022-11-23 13:51:48,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 4876 states and 15604 transitions. [2022-11-23 13:51:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:48,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:48,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:48,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-23 13:51:48,306 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash 300519996, now seen corresponding path program 4 times [2022-11-23 13:51:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:48,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253413163] [2022-11-23 13:51:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:48,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:49,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:49,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253413163] [2022-11-23 13:51:49,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253413163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:49,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:49,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:51:49,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899130343] [2022-11-23 13:51:49,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:49,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:51:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:49,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:51:49,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:51:49,209 INFO L87 Difference]: Start difference. First operand 4876 states and 15604 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:51,298 INFO L93 Difference]: Finished difference Result 7256 states and 23565 transitions. [2022-11-23 13:51:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:51:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:51,312 INFO L225 Difference]: With dead ends: 7256 [2022-11-23 13:51:51,312 INFO L226 Difference]: Without dead ends: 7256 [2022-11-23 13:51:51,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2022-11-23 13:51:51,313 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 303 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2409 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:51,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 74 Invalid, 2421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2409 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:51:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2022-11-23 13:51:51,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 5069. [2022-11-23 13:51:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5069 states, 5065 states have (on average 3.2017769002961503) internal successors, (16217), 5068 states have internal predecessors, (16217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:51,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5069 states to 5069 states and 16217 transitions. [2022-11-23 13:51:51,398 INFO L78 Accepts]: Start accepts. Automaton has 5069 states and 16217 transitions. Word has length 27 [2022-11-23 13:51:51,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:51,399 INFO L495 AbstractCegarLoop]: Abstraction has 5069 states and 16217 transitions. [2022-11-23 13:51:51,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:51,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5069 states and 16217 transitions. [2022-11-23 13:51:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:51,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:51,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:51,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-23 13:51:51,403 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:51,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:51,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1483140774, now seen corresponding path program 6 times [2022-11-23 13:51:51,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:51,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889882686] [2022-11-23 13:51:51,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:51,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:52,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-11-23 13:51:52,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:52,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889882686] [2022-11-23 13:51:52,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889882686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:52,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:52,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:51:52,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268428298] [2022-11-23 13:51:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:51:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:52,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:51:52,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:51:52,374 INFO L87 Difference]: Start difference. First operand 5069 states and 16217 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:54,843 INFO L93 Difference]: Finished difference Result 7579 states and 24420 transitions. [2022-11-23 13:51:54,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:51:54,843 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:54,858 INFO L225 Difference]: With dead ends: 7579 [2022-11-23 13:51:54,858 INFO L226 Difference]: Without dead ends: 7579 [2022-11-23 13:51:54,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:51:54,858 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 363 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2729 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:54,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 98 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2729 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-23 13:51:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7579 states. [2022-11-23 13:51:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7579 to 5193. [2022-11-23 13:51:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5193 states, 5189 states have (on average 3.1969550973212564) internal successors, (16589), 5192 states have internal predecessors, (16589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 16589 transitions. [2022-11-23 13:51:54,951 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 16589 transitions. Word has length 27 [2022-11-23 13:51:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:54,952 INFO L495 AbstractCegarLoop]: Abstraction has 5193 states and 16589 transitions. [2022-11-23 13:51:54,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 16589 transitions. [2022-11-23 13:51:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:54,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:54,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:54,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-23 13:51:54,957 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:54,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 947380032, now seen corresponding path program 7 times [2022-11-23 13:51:54,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411187519] [2022-11-23 13:51:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:56,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-11-23 13:51:56,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:56,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411187519] [2022-11-23 13:51:56,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411187519] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:56,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:56,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:56,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933884528] [2022-11-23 13:51:56,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:56,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:56,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:56,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:56,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:56,145 INFO L87 Difference]: Start difference. First operand 5193 states and 16589 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:51:58,505 INFO L93 Difference]: Finished difference Result 6727 states and 21736 transitions. [2022-11-23 13:51:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:51:58,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:51:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:51:58,518 INFO L225 Difference]: With dead ends: 6727 [2022-11-23 13:51:58,518 INFO L226 Difference]: Without dead ends: 6727 [2022-11-23 13:51:58,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=763, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:51:58,519 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 362 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2394 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:51:58,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 73 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2394 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:51:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6727 states. [2022-11-23 13:51:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6727 to 5301. [2022-11-23 13:51:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5301 states, 5297 states have (on average 3.192939399660185) internal successors, (16913), 5300 states have internal predecessors, (16913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5301 states to 5301 states and 16913 transitions. [2022-11-23 13:51:58,605 INFO L78 Accepts]: Start accepts. Automaton has 5301 states and 16913 transitions. Word has length 27 [2022-11-23 13:51:58,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:51:58,605 INFO L495 AbstractCegarLoop]: Abstraction has 5301 states and 16913 transitions. [2022-11-23 13:51:58,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:51:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 5301 states and 16913 transitions. [2022-11-23 13:51:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:51:58,610 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:51:58,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:51:58,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-23 13:51:58,610 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:51:58,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:51:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1179231368, now seen corresponding path program 8 times [2022-11-23 13:51:58,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:51:58,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905222773] [2022-11-23 13:51:58,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:51:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:51:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:51:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:51:59,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:51:59,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905222773] [2022-11-23 13:51:59,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905222773] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:51:59,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:51:59,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:51:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225004784] [2022-11-23 13:51:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:51:59,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:51:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:51:59,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:51:59,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:51:59,711 INFO L87 Difference]: Start difference. First operand 5301 states and 16913 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:02,927 INFO L93 Difference]: Finished difference Result 7810 states and 25292 transitions. [2022-11-23 13:52:02,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:52:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:02,943 INFO L225 Difference]: With dead ends: 7810 [2022-11-23 13:52:02,943 INFO L226 Difference]: Without dead ends: 7810 [2022-11-23 13:52:02,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 13:52:02,943 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 373 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3405 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:02,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 94 Invalid, 3423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3405 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-23 13:52:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2022-11-23 13:52:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 5553. [2022-11-23 13:52:03,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5549 states have (on average 3.2020183816903947) internal successors, (17768), 5552 states have internal predecessors, (17768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:03,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 17768 transitions. [2022-11-23 13:52:03,039 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 17768 transitions. Word has length 27 [2022-11-23 13:52:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:03,039 INFO L495 AbstractCegarLoop]: Abstraction has 5553 states and 17768 transitions. [2022-11-23 13:52:03,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:03,040 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 17768 transitions. [2022-11-23 13:52:03,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:03,046 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:03,046 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:03,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-23 13:52:03,046 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:03,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1017838528, now seen corresponding path program 9 times [2022-11-23 13:52:03,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:03,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162253775] [2022-11-23 13:52:03,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:03,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:03,906 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:03,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162253775] [2022-11-23 13:52:03,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162253775] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:03,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:03,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:52:03,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045100219] [2022-11-23 13:52:03,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:03,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:52:03,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:03,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:52:03,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:52:03,908 INFO L87 Difference]: Start difference. First operand 5553 states and 17768 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:06,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:06,726 INFO L93 Difference]: Finished difference Result 7771 states and 25162 transitions. [2022-11-23 13:52:06,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:52:06,727 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:06,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:06,742 INFO L225 Difference]: With dead ends: 7771 [2022-11-23 13:52:06,742 INFO L226 Difference]: Without dead ends: 7771 [2022-11-23 13:52:06,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=863, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:52:06,743 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 409 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:06,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 98 Invalid, 2901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-23 13:52:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7771 states. [2022-11-23 13:52:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7771 to 5574. [2022-11-23 13:52:06,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5574 states, 5570 states have (on average 3.201795332136445) internal successors, (17834), 5573 states have internal predecessors, (17834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5574 states to 5574 states and 17834 transitions. [2022-11-23 13:52:06,839 INFO L78 Accepts]: Start accepts. Automaton has 5574 states and 17834 transitions. Word has length 27 [2022-11-23 13:52:06,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:06,840 INFO L495 AbstractCegarLoop]: Abstraction has 5574 states and 17834 transitions. [2022-11-23 13:52:06,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 5574 states and 17834 transitions. [2022-11-23 13:52:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:06,845 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:06,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:06,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-11-23 13:52:06,845 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:06,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2003527104, now seen corresponding path program 10 times [2022-11-23 13:52:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:06,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567731431] [2022-11-23 13:52:06,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:06,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:07,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567731431] [2022-11-23 13:52:07,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567731431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:07,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:52:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550870367] [2022-11-23 13:52:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:07,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:52:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:07,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:52:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:52:07,956 INFO L87 Difference]: Start difference. First operand 5574 states and 17834 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:10,762 INFO L93 Difference]: Finished difference Result 7980 states and 25617 transitions. [2022-11-23 13:52:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:52:10,763 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:10,778 INFO L225 Difference]: With dead ends: 7980 [2022-11-23 13:52:10,778 INFO L226 Difference]: Without dead ends: 7980 [2022-11-23 13:52:10,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=759, Unknown=0, NotChecked=0, Total=930 [2022-11-23 13:52:10,779 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 343 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3014 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:10,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 93 Invalid, 3032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3014 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 13:52:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7980 states. [2022-11-23 13:52:10,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7980 to 6174. [2022-11-23 13:52:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6174 states, 6170 states have (on average 3.182171799027553) internal successors, (19634), 6173 states have internal predecessors, (19634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 19634 transitions. [2022-11-23 13:52:10,885 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 19634 transitions. Word has length 27 [2022-11-23 13:52:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:10,886 INFO L495 AbstractCegarLoop]: Abstraction has 6174 states and 19634 transitions. [2022-11-23 13:52:10,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 19634 transitions. [2022-11-23 13:52:10,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:10,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:10,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:10,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-11-23 13:52:10,895 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:10,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash 164828792, now seen corresponding path program 11 times [2022-11-23 13:52:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:10,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136882470] [2022-11-23 13:52:10,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:11,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-11-23 13:52:11,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:11,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136882470] [2022-11-23 13:52:11,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136882470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:11,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:11,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:52:11,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866835824] [2022-11-23 13:52:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:11,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:52:11,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:52:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:52:11,768 INFO L87 Difference]: Start difference. First operand 6174 states and 19634 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:15,113 INFO L93 Difference]: Finished difference Result 9154 states and 29508 transitions. [2022-11-23 13:52:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:52:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:15,131 INFO L225 Difference]: With dead ends: 9154 [2022-11-23 13:52:15,131 INFO L226 Difference]: Without dead ends: 9154 [2022-11-23 13:52:15,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 13:52:15,133 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 349 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 3570 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 3588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:15,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 96 Invalid, 3588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3570 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-11-23 13:52:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9154 states. [2022-11-23 13:52:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9154 to 6094. [2022-11-23 13:52:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6094 states, 6090 states have (on average 3.1886699507389165) internal successors, (19419), 6093 states have internal predecessors, (19419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6094 states to 6094 states and 19419 transitions. [2022-11-23 13:52:15,278 INFO L78 Accepts]: Start accepts. Automaton has 6094 states and 19419 transitions. Word has length 27 [2022-11-23 13:52:15,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:15,278 INFO L495 AbstractCegarLoop]: Abstraction has 6094 states and 19419 transitions. [2022-11-23 13:52:15,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6094 states and 19419 transitions. [2022-11-23 13:52:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:15,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:15,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:15,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-11-23 13:52:15,285 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:15,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1410838618, now seen corresponding path program 12 times [2022-11-23 13:52:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788882302] [2022-11-23 13:52:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:16,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:16,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788882302] [2022-11-23 13:52:16,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788882302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:16,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:16,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:52:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826968657] [2022-11-23 13:52:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:16,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:52:16,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:16,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:52:16,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:52:16,437 INFO L87 Difference]: Start difference. First operand 6094 states and 19419 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:19,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:19,847 INFO L93 Difference]: Finished difference Result 7748 states and 25065 transitions. [2022-11-23 13:52:19,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 13:52:19,847 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:19,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:19,862 INFO L225 Difference]: With dead ends: 7748 [2022-11-23 13:52:19,863 INFO L226 Difference]: Without dead ends: 7748 [2022-11-23 13:52:19,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=253, Invalid=1007, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 13:52:19,863 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 377 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:19,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 80 Invalid, 2977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 13:52:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7748 states. [2022-11-23 13:52:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7748 to 6482. [2022-11-23 13:52:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6482 states, 6478 states have (on average 3.212256869404137) internal successors, (20809), 6481 states have internal predecessors, (20809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6482 states to 6482 states and 20809 transitions. [2022-11-23 13:52:19,984 INFO L78 Accepts]: Start accepts. Automaton has 6482 states and 20809 transitions. Word has length 27 [2022-11-23 13:52:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:19,984 INFO L495 AbstractCegarLoop]: Abstraction has 6482 states and 20809 transitions. [2022-11-23 13:52:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 6482 states and 20809 transitions. [2022-11-23 13:52:19,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:19,992 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:19,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-23 13:52:19,992 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1410838617, now seen corresponding path program 1 times [2022-11-23 13:52:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:19,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261139959] [2022-11-23 13:52:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:19,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:20,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:20,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261139959] [2022-11-23 13:52:20,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261139959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:20,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:52:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320351099] [2022-11-23 13:52:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:20,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:52:20,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:52:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:52:20,809 INFO L87 Difference]: Start difference. First operand 6482 states and 20809 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:23,187 INFO L93 Difference]: Finished difference Result 8586 states and 27712 transitions. [2022-11-23 13:52:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:52:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:23,208 INFO L225 Difference]: With dead ends: 8586 [2022-11-23 13:52:23,209 INFO L226 Difference]: Without dead ends: 8586 [2022-11-23 13:52:23,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:52:23,210 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 352 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:23,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 88 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 13:52:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8586 states. [2022-11-23 13:52:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8586 to 5354. [2022-11-23 13:52:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5354 states, 5350 states have (on average 3.2110280373831777) internal successors, (17179), 5353 states have internal predecessors, (17179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 17179 transitions. [2022-11-23 13:52:23,321 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 17179 transitions. Word has length 27 [2022-11-23 13:52:23,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:23,321 INFO L495 AbstractCegarLoop]: Abstraction has 5354 states and 17179 transitions. [2022-11-23 13:52:23,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 17179 transitions. [2022-11-23 13:52:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:23,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:23,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-11-23 13:52:23,330 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -334440724, now seen corresponding path program 5 times [2022-11-23 13:52:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:23,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480173728] [2022-11-23 13:52:23,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:24,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-11-23 13:52:24,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:24,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480173728] [2022-11-23 13:52:24,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480173728] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:24,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:24,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:52:24,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803549787] [2022-11-23 13:52:24,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:24,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:52:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:52:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:52:24,289 INFO L87 Difference]: Start difference. First operand 5354 states and 17179 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:26,273 INFO L93 Difference]: Finished difference Result 6783 states and 22011 transitions. [2022-11-23 13:52:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:52:26,273 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:26,291 INFO L225 Difference]: With dead ends: 6783 [2022-11-23 13:52:26,292 INFO L226 Difference]: Without dead ends: 6783 [2022-11-23 13:52:26,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:52:26,293 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 299 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2003 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:26,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 43 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2003 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:52:26,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6783 states. [2022-11-23 13:52:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6783 to 5227. [2022-11-23 13:52:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 5223 states have (on average 3.216159295424086) internal successors, (16798), 5226 states have internal predecessors, (16798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 16798 transitions. [2022-11-23 13:52:26,384 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 16798 transitions. Word has length 27 [2022-11-23 13:52:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:26,385 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 16798 transitions. [2022-11-23 13:52:26,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:26,385 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 16798 transitions. [2022-11-23 13:52:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:26,389 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:26,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, 1] [2022-11-23 13:52:26,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-23 13:52:26,390 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:26,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:26,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1565832288, now seen corresponding path program 6 times [2022-11-23 13:52:26,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:26,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763128259] [2022-11-23 13:52:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:27,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:27,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763128259] [2022-11-23 13:52:27,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763128259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:27,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:27,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:52:27,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920511554] [2022-11-23 13:52:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:27,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:52:27,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:27,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:52:27,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:52:27,367 INFO L87 Difference]: Start difference. First operand 5227 states and 16798 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:29,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:29,507 INFO L93 Difference]: Finished difference Result 7901 states and 25540 transitions. [2022-11-23 13:52:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:52:29,508 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:29,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:29,524 INFO L225 Difference]: With dead ends: 7901 [2022-11-23 13:52:29,524 INFO L226 Difference]: Without dead ends: 7901 [2022-11-23 13:52:29,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:52:29,525 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 259 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 2332 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:29,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 56 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2332 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:52:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2022-11-23 13:52:29,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 5524. [2022-11-23 13:52:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5524 states, 5520 states have (on average 3.2045289855072463) internal successors, (17689), 5523 states have internal predecessors, (17689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:29,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 17689 transitions. [2022-11-23 13:52:29,624 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 17689 transitions. Word has length 27 [2022-11-23 13:52:29,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:29,624 INFO L495 AbstractCegarLoop]: Abstraction has 5524 states and 17689 transitions. [2022-11-23 13:52:29,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:29,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 17689 transitions. [2022-11-23 13:52:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:29,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:29,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:29,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-11-23 13:52:29,630 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:29,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:29,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1842289140, now seen corresponding path program 7 times [2022-11-23 13:52:29,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:29,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449490220] [2022-11-23 13:52:29,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:29,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:30,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:30,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449490220] [2022-11-23 13:52:30,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449490220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:30,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:30,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:52:30,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65871930] [2022-11-23 13:52:30,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:30,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:52:30,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:30,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:52:30,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:52:30,503 INFO L87 Difference]: Start difference. First operand 5524 states and 17689 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:32,627 INFO L93 Difference]: Finished difference Result 8152 states and 26421 transitions. [2022-11-23 13:52:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:52:32,628 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:32,648 INFO L225 Difference]: With dead ends: 8152 [2022-11-23 13:52:32,648 INFO L226 Difference]: Without dead ends: 8152 [2022-11-23 13:52:32,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2022-11-23 13:52:32,649 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 329 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:32,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 80 Invalid, 2433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:52:32,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8152 states. [2022-11-23 13:52:32,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8152 to 5128. [2022-11-23 13:52:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 5124 states have (on average 3.220335675253708) internal successors, (16501), 5127 states have internal predecessors, (16501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 16501 transitions. [2022-11-23 13:52:32,790 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 16501 transitions. Word has length 27 [2022-11-23 13:52:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:32,791 INFO L495 AbstractCegarLoop]: Abstraction has 5128 states and 16501 transitions. [2022-11-23 13:52:32,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 16501 transitions. [2022-11-23 13:52:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:32,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:32,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:32,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-11-23 13:52:32,798 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:32,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:32,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2136256262, now seen corresponding path program 8 times [2022-11-23 13:52:32,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:32,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631604000] [2022-11-23 13:52:32,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:32,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:33,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:33,841 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:33,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631604000] [2022-11-23 13:52:33,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631604000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:33,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:33,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-23 13:52:33,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404778896] [2022-11-23 13:52:33,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:33,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-23 13:52:33,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:33,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-23 13:52:33,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-11-23 13:52:33,842 INFO L87 Difference]: Start difference. First operand 5128 states and 16501 transitions. Second operand has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:36,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:36,652 INFO L93 Difference]: Finished difference Result 6596 states and 21450 transitions. [2022-11-23 13:52:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 13:52:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:36,665 INFO L225 Difference]: With dead ends: 6596 [2022-11-23 13:52:36,665 INFO L226 Difference]: Without dead ends: 6596 [2022-11-23 13:52:36,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2022-11-23 13:52:36,666 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 296 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:36,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 81 Invalid, 3002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-23 13:52:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2022-11-23 13:52:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 5095. [2022-11-23 13:52:36,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5095 states, 5091 states have (on average 3.2217638970732665) internal successors, (16402), 5094 states have internal predecessors, (16402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5095 states to 5095 states and 16402 transitions. [2022-11-23 13:52:36,750 INFO L78 Accepts]: Start accepts. Automaton has 5095 states and 16402 transitions. Word has length 27 [2022-11-23 13:52:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:36,751 INFO L495 AbstractCegarLoop]: Abstraction has 5095 states and 16402 transitions. [2022-11-23 13:52:36,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5095 states and 16402 transitions. [2022-11-23 13:52:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:36,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:36,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:36,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-11-23 13:52:36,756 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:36,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1632535772, now seen corresponding path program 9 times [2022-11-23 13:52:36,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:36,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564355989] [2022-11-23 13:52:36,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:36,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:37,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:37,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564355989] [2022-11-23 13:52:37,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564355989] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:37,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:37,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-23 13:52:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902166947] [2022-11-23 13:52:37,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:37,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-23 13:52:37,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:37,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-23 13:52:37,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-11-23 13:52:37,765 INFO L87 Difference]: Start difference. First operand 5095 states and 16402 transitions. Second operand has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:40,299 INFO L93 Difference]: Finished difference Result 7701 states and 25068 transitions. [2022-11-23 13:52:40,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 13:52:40,299 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:40,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:40,314 INFO L225 Difference]: With dead ends: 7701 [2022-11-23 13:52:40,314 INFO L226 Difference]: Without dead ends: 7701 [2022-11-23 13:52:40,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:52:40,315 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 350 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2787 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:40,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 100 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2787 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-23 13:52:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7701 states. [2022-11-23 13:52:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7701 to 4798. [2022-11-23 13:52:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4798 states, 4794 states have (on average 3.235502711722987) internal successors, (15511), 4797 states have internal predecessors, (15511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4798 states to 4798 states and 15511 transitions. [2022-11-23 13:52:40,405 INFO L78 Accepts]: Start accepts. Automaton has 4798 states and 15511 transitions. Word has length 27 [2022-11-23 13:52:40,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:40,405 INFO L495 AbstractCegarLoop]: Abstraction has 4798 states and 15511 transitions. [2022-11-23 13:52:40,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:40,406 INFO L276 IsEmpty]: Start isEmpty. Operand 4798 states and 15511 transitions. [2022-11-23 13:52:40,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:40,410 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:40,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-23 13:52:40,410 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -61124388, now seen corresponding path program 10 times [2022-11-23 13:52:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835513851] [2022-11-23 13:52:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:41,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-11-23 13:52:41,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:41,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835513851] [2022-11-23 13:52:41,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835513851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:41,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:41,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:52:41,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481927865] [2022-11-23 13:52:41,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:41,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:52:41,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:41,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:52:41,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:52:41,139 INFO L87 Difference]: Start difference. First operand 4798 states and 15511 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:43,347 INFO L93 Difference]: Finished difference Result 7969 states and 26262 transitions. [2022-11-23 13:52:43,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:52:43,348 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:43,364 INFO L225 Difference]: With dead ends: 7969 [2022-11-23 13:52:43,364 INFO L226 Difference]: Without dead ends: 7969 [2022-11-23 13:52:43,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-11-23 13:52:43,365 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 368 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:43,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 84 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:52:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7969 states. [2022-11-23 13:52:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7969 to 4841. [2022-11-23 13:52:43,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4841 states, 4837 states have (on average 3.2373371924746746) internal successors, (15659), 4840 states have internal predecessors, (15659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4841 states to 4841 states and 15659 transitions. [2022-11-23 13:52:43,457 INFO L78 Accepts]: Start accepts. Automaton has 4841 states and 15659 transitions. Word has length 27 [2022-11-23 13:52:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:43,458 INFO L495 AbstractCegarLoop]: Abstraction has 4841 states and 15659 transitions. [2022-11-23 13:52:43,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4841 states and 15659 transitions. [2022-11-23 13:52:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 13:52:43,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:43,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:52:43,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-11-23 13:52:43,463 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:43,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:43,463 INFO L85 PathProgramCache]: Analyzing trace with hash -101159494, now seen corresponding path program 11 times [2022-11-23 13:52:43,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:43,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427334940] [2022-11-23 13:52:43,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:43,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:44,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:44,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427334940] [2022-11-23 13:52:44,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427334940] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:52:44,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:52:44,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:52:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648488885] [2022-11-23 13:52:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:52:44,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:52:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:44,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:52:44,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:52:44,495 INFO L87 Difference]: Start difference. First operand 4841 states and 15659 transitions. Second operand has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:46,692 INFO L93 Difference]: Finished difference Result 6607 states and 21610 transitions. [2022-11-23 13:52:46,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-23 13:52:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 13:52:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:46,705 INFO L225 Difference]: With dead ends: 6607 [2022-11-23 13:52:46,705 INFO L226 Difference]: Without dead ends: 6607 [2022-11-23 13:52:46,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-11-23 13:52:46,706 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 331 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2433 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 2446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:46,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 83 Invalid, 2446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2433 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:52:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6607 states. [2022-11-23 13:52:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6607 to 4591. [2022-11-23 13:52:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4587 states have (on average 3.2459123610202747) internal successors, (14889), 4590 states have internal predecessors, (14889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 14889 transitions. [2022-11-23 13:52:46,786 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 14889 transitions. Word has length 27 [2022-11-23 13:52:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:46,786 INFO L495 AbstractCegarLoop]: Abstraction has 4591 states and 14889 transitions. [2022-11-23 13:52:46,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 14889 transitions. [2022-11-23 13:52:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 13:52:46,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:46,791 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-11-23 13:52:46,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-11-23 13:52:46,791 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:46,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 392542502, now seen corresponding path program 1 times [2022-11-23 13:52:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:46,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781451962] [2022-11-23 13:52:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:47,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:47,857 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:52:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781451962] [2022-11-23 13:52:47,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781451962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:52:47,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147818683] [2022-11-23 13:52:47,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:47,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:52:47,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:52:47,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:52:47,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 13:52:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:52:48,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 89 conjunts are in the unsatisfiable core [2022-11-23 13:52:48,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:52:48,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:48,219 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-11-23 13:52:48,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:48,226 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-11-23 13:52:48,251 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-11-23 13:52:48,309 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 21 [2022-11-23 13:52:48,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:52:48,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:52:48,797 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 13:52:48,798 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 37 treesize of output 38 [2022-11-23 13:52:48,871 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:52:48,872 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 33 treesize of output 31 [2022-11-23 13:52:49,023 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 13:52:49,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 13:52:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:49,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:52:53,144 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1507 Int) (v_ArrVal_1509 Int) (v_ArrVal_1506 (Array Int Int))) (or (< v_ArrVal_1507 1) (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1506) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse2 .cse1) 4)) v_ArrVal_1507)))) (select (store .cse0 .cse1 v_ArrVal_1509) (+ (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) |c_ULTIMATE.start_main_~#r~3#1.offset| 4))))))) is different from false [2022-11-23 13:52:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:52:53,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147818683] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:52:53,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636046065] [2022-11-23 13:52:53,159 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:336) 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-11-23 13:52:53,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:52:53,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-23 13:52:53,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061064233] [2022-11-23 13:52:53,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:52:53,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:52:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:52:53,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:52:53,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1216, Unknown=5, NotChecked=70, Total=1406 [2022-11-23 13:52:53,165 INFO L87 Difference]: Start difference. First operand 4591 states and 14889 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:52:58,894 INFO L93 Difference]: Finished difference Result 6939 states and 22749 transitions. [2022-11-23 13:52:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 13:52:58,895 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-23 13:52:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:52:58,909 INFO L225 Difference]: With dead ends: 6939 [2022-11-23 13:52:58,909 INFO L226 Difference]: Without dead ends: 6939 [2022-11-23 13:52:58,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=378, Invalid=2483, Unknown=5, NotChecked=104, Total=2970 [2022-11-23 13:52:58,910 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 694 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 4183 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 4183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:52:58,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 150 Invalid, 4319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 4183 Invalid, 0 Unknown, 119 Unchecked, 4.2s Time] [2022-11-23 13:52:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6939 states. [2022-11-23 13:52:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6939 to 4591. [2022-11-23 13:52:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4587 states have (on average 3.2459123610202747) internal successors, (14889), 4590 states have internal predecessors, (14889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 14889 transitions. [2022-11-23 13:52:59,025 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 14889 transitions. Word has length 29 [2022-11-23 13:52:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:52:59,026 INFO L495 AbstractCegarLoop]: Abstraction has 4591 states and 14889 transitions. [2022-11-23 13:52:59,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:52:59,026 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 14889 transitions. [2022-11-23 13:52:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 13:52:59,030 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:52:59,030 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-11-23 13:52:59,039 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-23 13:52:59,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-11-23 13:52:59,231 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:52:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:52:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash 872239086, now seen corresponding path program 2 times [2022-11-23 13:52:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:52:59,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125572934] [2022-11-23 13:52:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:52:59,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:52:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:00,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125572934] [2022-11-23 13:53:00,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125572934] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:00,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740672578] [2022-11-23 13:53:00,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:53:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:00,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:00,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 13:53:00,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:53:00,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:00,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-23 13:53:00,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:00,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:00,497 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-11-23 13:53:00,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:00,503 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-11-23 13:53:00,511 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-11-23 13:53:00,545 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 21 [2022-11-23 13:53:00,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:00,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:00,831 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 13:53:00,831 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 37 treesize of output 38 [2022-11-23 13:53:01,111 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-23 13:53:01,111 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-11-23 13:53:01,271 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 13:53:01,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 13:53:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:01,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:04,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1589 Int) (v_ArrVal_1588 Int)) (or (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1586))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse3)) 4) v_ArrVal_1588)) .cse3 v_ArrVal_1589)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ (* 4 (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|)) |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| 4)))) (< v_ArrVal_1588 1))) is different from false [2022-11-23 13:53:04,931 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1589 Int) (v_ArrVal_1588 Int)) (or (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1586) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* 4 (select .cse2 .cse1)) 4) v_ArrVal_1588)))) (select (store .cse0 .cse1 v_ArrVal_1589) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 4 (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4)))))) (< v_ArrVal_1588 1))) is different from false [2022-11-23 13:53:04,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:04,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740672578] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:04,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1062509610] [2022-11-23 13:53:04,935 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:336) 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-11-23 13:53:04,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:04,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-23 13:53:04,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737690764] [2022-11-23 13:53:04,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:04,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:53:04,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:04,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:53:04,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1151, Unknown=3, NotChecked=138, Total=1406 [2022-11-23 13:53:04,938 INFO L87 Difference]: Start difference. First operand 4591 states and 14889 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:15,633 INFO L93 Difference]: Finished difference Result 9088 states and 30123 transitions. [2022-11-23 13:53:15,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-23 13:53:15,634 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-23 13:53:15,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:15,653 INFO L225 Difference]: With dead ends: 9088 [2022-11-23 13:53:15,653 INFO L226 Difference]: Without dead ends: 9088 [2022-11-23 13:53:15,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=479, Invalid=3185, Unknown=4, NotChecked=238, Total=3906 [2022-11-23 13:53:15,654 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 873 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:15,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 185 Invalid, 5946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5248 Invalid, 0 Unknown, 678 Unchecked, 6.0s Time] [2022-11-23 13:53:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9088 states. [2022-11-23 13:53:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9088 to 5170. [2022-11-23 13:53:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5170 states, 5166 states have (on average 3.2880371660859464) internal successors, (16986), 5169 states have internal predecessors, (16986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:15,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5170 states to 5170 states and 16986 transitions. [2022-11-23 13:53:15,786 INFO L78 Accepts]: Start accepts. Automaton has 5170 states and 16986 transitions. Word has length 29 [2022-11-23 13:53:15,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:15,786 INFO L495 AbstractCegarLoop]: Abstraction has 5170 states and 16986 transitions. [2022-11-23 13:53:15,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:15,786 INFO L276 IsEmpty]: Start isEmpty. Operand 5170 states and 16986 transitions. [2022-11-23 13:53:15,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 13:53:15,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:15,791 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-11-23 13:53:15,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-23 13:53:15,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-11-23 13:53:15,991 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -116662444, now seen corresponding path program 3 times [2022-11-23 13:53:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273802362] [2022-11-23 13:53:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:16,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:16,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273802362] [2022-11-23 13:53:16,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273802362] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:16,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124460246] [2022-11-23 13:53:16,940 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:53:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:16,942 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:16,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 13:53:17,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:53:17,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:53:17,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 13:53:17,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:17,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:17,206 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-11-23 13:53:17,212 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-11-23 13:53:17,218 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-11-23 13:53:17,264 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 21 [2022-11-23 13:53:17,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:17,508 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:17,529 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 13:53:17,529 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 37 treesize of output 38 [2022-11-23 13:53:17,600 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:53:17,600 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 33 treesize of output 31 [2022-11-23 13:53:17,835 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 13:53:17,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 13:53:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:17,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:19,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 Int) (v_ArrVal_1669 Int)) (or (< v_ArrVal_1669 1) (< 0 (let ((.cse0 (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1667))) (store .cse1 |c_ULTIMATE.start_main_~#r~3#1.base| (let ((.cse3 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (store (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse3) 4) 4) v_ArrVal_1669)) .cse3 v_ArrVal_1671)))) |c_reader_twoThread1of1ForFork1_#in~arg#1.base|))) (select .cse0 (+ |c_reader_twoThread1of1ForFork1_#in~arg#1.offset| (* (select .cse0 |c_reader_twoThread1of1ForFork1_#in~arg#1.offset|) 4) 4)))))) is different from false [2022-11-23 13:53:19,551 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1667 (Array Int Int)) (v_ArrVal_1671 Int) (v_ArrVal_1669 Int)) (or (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1667) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) v_ArrVal_1669)))) (select (store .cse0 .cse1 v_ArrVal_1671) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))) (< v_ArrVal_1669 1))) is different from false [2022-11-23 13:53:19,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:19,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124460246] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:19,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [523226061] [2022-11-23 13:53:19,554 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:336) 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-11-23 13:53:19,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:19,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-23 13:53:19,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752140726] [2022-11-23 13:53:19,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:19,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-23 13:53:19,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-23 13:53:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1151, Unknown=2, NotChecked=138, Total=1406 [2022-11-23 13:53:19,557 INFO L87 Difference]: Start difference. First operand 5170 states and 16986 transitions. Second operand has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:26,045 INFO L93 Difference]: Finished difference Result 8660 states and 28733 transitions. [2022-11-23 13:53:26,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 13:53:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-23 13:53:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:26,062 INFO L225 Difference]: With dead ends: 8660 [2022-11-23 13:53:26,063 INFO L226 Difference]: Without dead ends: 8660 [2022-11-23 13:53:26,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=457, Invalid=2629, Unknown=2, NotChecked=218, Total=3306 [2022-11-23 13:53:26,063 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 843 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4759 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 5531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:26,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 174 Invalid, 5531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4759 Invalid, 0 Unknown, 750 Unchecked, 4.6s Time] [2022-11-23 13:53:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8660 states. [2022-11-23 13:53:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8660 to 4589. [2022-11-23 13:53:26,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4589 states, 4585 states have (on average 3.244711014176663) internal successors, (14877), 4588 states have internal predecessors, (14877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4589 states to 4589 states and 14877 transitions. [2022-11-23 13:53:26,153 INFO L78 Accepts]: Start accepts. Automaton has 4589 states and 14877 transitions. Word has length 29 [2022-11-23 13:53:26,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:26,153 INFO L495 AbstractCegarLoop]: Abstraction has 4589 states and 14877 transitions. [2022-11-23 13:53:26,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.189189189189189) internal successors, (81), 37 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:26,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4589 states and 14877 transitions. [2022-11-23 13:53:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-23 13:53:26,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:26,157 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-11-23 13:53:26,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:26,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-11-23 13:53:26,358 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:26,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash -750799834, now seen corresponding path program 4 times [2022-11-23 13:53:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:26,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860095298] [2022-11-23 13:53:26,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:26,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:27,264 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860095298] [2022-11-23 13:53:27,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860095298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:53:27,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259769895] [2022-11-23 13:53:27,265 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 13:53:27,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:53:27,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:53:27,266 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:53:27,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 13:53:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:27,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 100 conjunts are in the unsatisfiable core [2022-11-23 13:53:27,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:53:27,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:27,514 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-11-23 13:53:27,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:27,521 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-11-23 13:53:27,530 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-11-23 13:53:27,566 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 21 [2022-11-23 13:53:27,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:53:27,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:53:28,016 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 13:53:28,016 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 37 treesize of output 38 [2022-11-23 13:53:28,097 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-11-23 13:53:28,097 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 38 [2022-11-23 13:53:28,313 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 13:53:28,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 13:53:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:28,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:53:33,849 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1747 (Array Int Int)) (v_ArrVal_1748 Int) (v_ArrVal_1751 Int)) (or (< v_ArrVal_1748 1) (< 0 (let ((.cse1 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| 20))) (let ((.cse0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_1747) |c_ULTIMATE.start_main_~#r~3#1.base|))) (store .cse2 (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse2 .cse1) 4) 4) v_ArrVal_1748)))) (select (store .cse0 .cse1 v_ArrVal_1751) (+ |c_ULTIMATE.start_main_~#r~3#1.offset| (* (select .cse0 |c_ULTIMATE.start_main_~#r~3#1.offset|) 4) 4))))))) is different from false [2022-11-23 13:53:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:33,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259769895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:53:33,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703653584] [2022-11-23 13:53:33,852 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:336) 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-11-23 13:53:33,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:53:33,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 37 [2022-11-23 13:53:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824005377] [2022-11-23 13:53:33,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:53:33,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-23 13:53:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:33,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-23 13:53:33,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1274, Unknown=17, NotChecked=72, Total=1482 [2022-11-23 13:53:33,855 INFO L87 Difference]: Start difference. First operand 4589 states and 14877 transitions. Second operand has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:40,290 INFO L93 Difference]: Finished difference Result 6871 states and 22440 transitions. [2022-11-23 13:53:40,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 13:53:40,290 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-23 13:53:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:40,304 INFO L225 Difference]: With dead ends: 6871 [2022-11-23 13:53:40,304 INFO L226 Difference]: Without dead ends: 6871 [2022-11-23 13:53:40,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=393, Invalid=2564, Unknown=17, NotChecked=106, Total=3080 [2022-11-23 13:53:40,305 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 780 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 4972 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 5132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:40,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 177 Invalid, 5132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4972 Invalid, 0 Unknown, 136 Unchecked, 4.8s Time] [2022-11-23 13:53:40,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2022-11-23 13:53:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 4009. [2022-11-23 13:53:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 4005 states have (on average 3.2491885143570536) internal successors, (13013), 4008 states have internal predecessors, (13013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:40,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 13013 transitions. [2022-11-23 13:53:40,423 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 13013 transitions. Word has length 29 [2022-11-23 13:53:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 13013 transitions. [2022-11-23 13:53:40,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 38 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:40,424 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 13013 transitions. [2022-11-23 13:53:40,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:40,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:40,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:40,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 13:53:40,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2022-11-23 13:53:40,635 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:40,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1049117738, now seen corresponding path program 1 times [2022-11-23 13:53:40,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:40,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537356269] [2022-11-23 13:53:40,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:41,198 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:41,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537356269] [2022-11-23 13:53:41,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537356269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:41,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:41,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-23 13:53:41,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901199448] [2022-11-23 13:53:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:41,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:53:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:53:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-23 13:53:41,200 INFO L87 Difference]: Start difference. First operand 4009 states and 13013 transitions. Second operand has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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-11-23 13:53:42,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:42,950 INFO L93 Difference]: Finished difference Result 10277 states and 33818 transitions. [2022-11-23 13:53:42,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 13:53:42,951 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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-11-23 13:53:42,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:42,972 INFO L225 Difference]: With dead ends: 10277 [2022-11-23 13:53:42,972 INFO L226 Difference]: Without dead ends: 10277 [2022-11-23 13:53:42,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:53:42,973 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 581 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:42,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 34 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-23 13:53:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10277 states. [2022-11-23 13:53:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10277 to 8572. [2022-11-23 13:53:43,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8572 states, 8568 states have (on average 3.3368347338935576) internal successors, (28590), 8571 states have internal predecessors, (28590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8572 states to 8572 states and 28590 transitions. [2022-11-23 13:53:43,122 INFO L78 Accepts]: Start accepts. Automaton has 8572 states and 28590 transitions. Word has length 30 [2022-11-23 13:53:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:43,123 INFO L495 AbstractCegarLoop]: Abstraction has 8572 states and 28590 transitions. [2022-11-23 13:53:43,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 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-11-23 13:53:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8572 states and 28590 transitions. [2022-11-23 13:53:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:43,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:43,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:43,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-11-23 13:53:43,130 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -86623766, now seen corresponding path program 1 times [2022-11-23 13:53:43,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:43,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997451770] [2022-11-23 13:53:43,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:43,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:43,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:43,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997451770] [2022-11-23 13:53:43,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997451770] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:43,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:43,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:53:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250912142] [2022-11-23 13:53:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:43,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:53:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:43,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:53:43,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:53:43,816 INFO L87 Difference]: Start difference. First operand 8572 states and 28590 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:45,963 INFO L93 Difference]: Finished difference Result 14704 states and 48698 transitions. [2022-11-23 13:53:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-23 13:53:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:46,013 INFO L225 Difference]: With dead ends: 14704 [2022-11-23 13:53:46,014 INFO L226 Difference]: Without dead ends: 14704 [2022-11-23 13:53:46,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-11-23 13:53:46,015 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 410 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:46,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 29 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:53:46,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14704 states. [2022-11-23 13:53:46,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14704 to 11134. [2022-11-23 13:53:46,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11134 states, 11130 states have (on average 3.3564240790655884) internal successors, (37357), 11133 states have internal predecessors, (37357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11134 states to 11134 states and 37357 transitions. [2022-11-23 13:53:46,242 INFO L78 Accepts]: Start accepts. Automaton has 11134 states and 37357 transitions. Word has length 30 [2022-11-23 13:53:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:46,243 INFO L495 AbstractCegarLoop]: Abstraction has 11134 states and 37357 transitions. [2022-11-23 13:53:46,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 11134 states and 37357 transitions. [2022-11-23 13:53:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:46,253 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:46,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:46,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-11-23 13:53:46,254 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1918051024, now seen corresponding path program 2 times [2022-11-23 13:53:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:46,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505676329] [2022-11-23 13:53:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:46,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:46,736 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:46,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505676329] [2022-11-23 13:53:46,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505676329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:46,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:46,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:53:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769500152] [2022-11-23 13:53:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:46,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:53:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:46,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:53:46,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:53:46,738 INFO L87 Difference]: Start difference. First operand 11134 states and 37357 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:49,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:49,711 INFO L93 Difference]: Finished difference Result 19986 states and 66696 transitions. [2022-11-23 13:53:49,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 13:53:49,712 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:49,760 INFO L225 Difference]: With dead ends: 19986 [2022-11-23 13:53:49,760 INFO L226 Difference]: Without dead ends: 19986 [2022-11-23 13:53:49,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 13:53:49,760 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 568 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1966 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:49,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 115 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1966 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 13:53:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19986 states. [2022-11-23 13:53:49,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19986 to 12411. [2022-11-23 13:53:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12411 states, 12407 states have (on average 3.3906665592004512) internal successors, (42068), 12410 states have internal predecessors, (42068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12411 states to 12411 states and 42068 transitions. [2022-11-23 13:53:50,034 INFO L78 Accepts]: Start accepts. Automaton has 12411 states and 42068 transitions. Word has length 30 [2022-11-23 13:53:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:50,035 INFO L495 AbstractCegarLoop]: Abstraction has 12411 states and 42068 transitions. [2022-11-23 13:53:50,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:50,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12411 states and 42068 transitions. [2022-11-23 13:53:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:50,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:50,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-11-23 13:53:50,049 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:50,049 INFO L85 PathProgramCache]: Analyzing trace with hash 84383990, now seen corresponding path program 3 times [2022-11-23 13:53:50,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:50,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068139005] [2022-11-23 13:53:50,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:50,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:50,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-11-23 13:53:50,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:50,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068139005] [2022-11-23 13:53:50,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068139005] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:50,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:50,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:53:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402031696] [2022-11-23 13:53:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:50,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:53:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:50,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:53:50,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:53:50,651 INFO L87 Difference]: Start difference. First operand 12411 states and 42068 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:53,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:53,409 INFO L93 Difference]: Finished difference Result 24079 states and 80775 transitions. [2022-11-23 13:53:53,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:53:53,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:53,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:53,466 INFO L225 Difference]: With dead ends: 24079 [2022-11-23 13:53:53,467 INFO L226 Difference]: Without dead ends: 24079 [2022-11-23 13:53:53,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=300, Invalid=756, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:53:53,467 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 604 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 1935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:53,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 81 Invalid, 1935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-23 13:53:53,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24079 states. [2022-11-23 13:53:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24079 to 12478. [2022-11-23 13:53:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12478 states, 12474 states have (on average 3.38985088985089) internal successors, (42285), 12477 states have internal predecessors, (42285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:53,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12478 states to 12478 states and 42285 transitions. [2022-11-23 13:53:53,765 INFO L78 Accepts]: Start accepts. Automaton has 12478 states and 42285 transitions. Word has length 30 [2022-11-23 13:53:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:53,765 INFO L495 AbstractCegarLoop]: Abstraction has 12478 states and 42285 transitions. [2022-11-23 13:53:53,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 12478 states and 42285 transitions. [2022-11-23 13:53:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:53,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:53,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:53,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-11-23 13:53:53,778 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:53,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:53,779 INFO L85 PathProgramCache]: Analyzing trace with hash 256516560, now seen corresponding path program 4 times [2022-11-23 13:53:53,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:53,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270376460] [2022-11-23 13:53:53,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:53,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:54,296 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:54,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270376460] [2022-11-23 13:53:54,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270376460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:54,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:54,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-23 13:53:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812166252] [2022-11-23 13:53:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:54,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:53:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:53:54,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-11-23 13:53:54,297 INFO L87 Difference]: Start difference. First operand 12478 states and 42285 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:56,564 INFO L93 Difference]: Finished difference Result 19325 states and 64401 transitions. [2022-11-23 13:53:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-23 13:53:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:56,613 INFO L225 Difference]: With dead ends: 19325 [2022-11-23 13:53:56,613 INFO L226 Difference]: Without dead ends: 19325 [2022-11-23 13:53:56,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-11-23 13:53:56,614 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 389 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:56,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 54 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-23 13:53:56,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19325 states. [2022-11-23 13:53:56,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19325 to 10481. [2022-11-23 13:53:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10481 states, 10477 states have (on average 3.3719576214565237) internal successors, (35328), 10480 states have internal predecessors, (35328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:53:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10481 states to 10481 states and 35328 transitions. [2022-11-23 13:53:56,851 INFO L78 Accepts]: Start accepts. Automaton has 10481 states and 35328 transitions. Word has length 30 [2022-11-23 13:53:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:53:56,851 INFO L495 AbstractCegarLoop]: Abstraction has 10481 states and 35328 transitions. [2022-11-23 13:53:56,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 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-11-23 13:53:56,851 INFO L276 IsEmpty]: Start isEmpty. Operand 10481 states and 35328 transitions. [2022-11-23 13:53:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:53:56,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:53:56,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:53:56,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-11-23 13:53:56,861 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:53:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:53:56,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1000344778, now seen corresponding path program 2 times [2022-11-23 13:53:56,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:53:56,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478620175] [2022-11-23 13:53:56,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:53:56,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:53:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:53:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:53:57,282 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:53:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478620175] [2022-11-23 13:53:57,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478620175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:53:57,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:53:57,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 13:53:57,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991537258] [2022-11-23 13:53:57,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:53:57,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:53:57,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:53:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:53:57,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:53:57,284 INFO L87 Difference]: Start difference. First operand 10481 states and 35328 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:53:59,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:53:59,844 INFO L93 Difference]: Finished difference Result 18585 states and 61855 transitions. [2022-11-23 13:53:59,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 13:53:59,844 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:53:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:53:59,889 INFO L225 Difference]: With dead ends: 18585 [2022-11-23 13:53:59,889 INFO L226 Difference]: Without dead ends: 18585 [2022-11-23 13:53:59,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2022-11-23 13:53:59,890 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 412 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1960 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:53:59,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 58 Invalid, 2000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1960 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-23 13:53:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18585 states. [2022-11-23 13:54:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18585 to 10667. [2022-11-23 13:54:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10667 states, 10663 states have (on average 3.3764419019037795) internal successors, (36003), 10666 states have internal predecessors, (36003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10667 states to 10667 states and 36003 transitions. [2022-11-23 13:54:00,123 INFO L78 Accepts]: Start accepts. Automaton has 10667 states and 36003 transitions. Word has length 30 [2022-11-23 13:54:00,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:00,124 INFO L495 AbstractCegarLoop]: Abstraction has 10667 states and 36003 transitions. [2022-11-23 13:54:00,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:54:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 10667 states and 36003 transitions. [2022-11-23 13:54:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 13:54:00,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:00,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:00,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-11-23 13:54:00,134 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:00,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1614917628, now seen corresponding path program 3 times [2022-11-23 13:54:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:00,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112435256] [2022-11-23 13:54:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:00,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:00,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:00,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112435256] [2022-11-23 13:54:00,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112435256] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:00,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:00,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-23 13:54:00,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545124311] [2022-11-23 13:54:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:00,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 13:54:00,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 13:54:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-11-23 13:54:00,638 INFO L87 Difference]: Start difference. First operand 10667 states and 36003 transitions. Second operand has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:54:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:03,294 INFO L93 Difference]: Finished difference Result 19346 states and 64956 transitions. [2022-11-23 13:54:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:03,294 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:54:03,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:03,340 INFO L225 Difference]: With dead ends: 19346 [2022-11-23 13:54:03,340 INFO L226 Difference]: Without dead ends: 19346 [2022-11-23 13:54:03,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=278, Invalid=778, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:54:03,340 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 448 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1711 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:03,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 77 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1711 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-23 13:54:03,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19346 states. [2022-11-23 13:54:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19346 to 9754. [2022-11-23 13:54:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9754 states, 9750 states have (on average 3.3932307692307693) internal successors, (33084), 9753 states have internal predecessors, (33084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 33084 transitions. [2022-11-23 13:54:03,594 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 33084 transitions. Word has length 30 [2022-11-23 13:54:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:03,595 INFO L495 AbstractCegarLoop]: Abstraction has 9754 states and 33084 transitions. [2022-11-23 13:54:03,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5) internal successors, (30), 12 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-11-23 13:54:03,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 33084 transitions. [2022-11-23 13:54:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:03,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:03,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:03,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-11-23 13:54:03,607 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash -486472177, now seen corresponding path program 1 times [2022-11-23 13:54:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46181568] [2022-11-23 13:54:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:03,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:03,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46181568] [2022-11-23 13:54:03,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46181568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:03,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:03,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 13:54:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866755611] [2022-11-23 13:54:03,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:03,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 13:54:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 13:54:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:54:03,676 INFO L87 Difference]: Start difference. First operand 9754 states and 33084 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:03,787 INFO L93 Difference]: Finished difference Result 4436 states and 13386 transitions. [2022-11-23 13:54:03,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 13:54:03,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:03,795 INFO L225 Difference]: With dead ends: 4436 [2022-11-23 13:54:03,796 INFO L226 Difference]: Without dead ends: 4436 [2022-11-23 13:54:03,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 13:54:03,796 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:03,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 13:54:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2022-11-23 13:54:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3748. [2022-11-23 13:54:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3748 states, 3744 states have (on average 2.968482905982906) internal successors, (11114), 3747 states have internal predecessors, (11114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3748 states to 3748 states and 11114 transitions. [2022-11-23 13:54:03,858 INFO L78 Accepts]: Start accepts. Automaton has 3748 states and 11114 transitions. Word has length 31 [2022-11-23 13:54:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:03,859 INFO L495 AbstractCegarLoop]: Abstraction has 3748 states and 11114 transitions. [2022-11-23 13:54:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:03,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3748 states and 11114 transitions. [2022-11-23 13:54:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:03,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:03,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:03,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-11-23 13:54:03,862 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:03,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1837090976, now seen corresponding path program 1 times [2022-11-23 13:54:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:03,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123621635] [2022-11-23 13:54:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:03,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:05,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:05,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123621635] [2022-11-23 13:54:05,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123621635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:05,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:05,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:05,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971512658] [2022-11-23 13:54:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:05,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:05,705 INFO L87 Difference]: Start difference. First operand 3748 states and 11114 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:10,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:10,043 INFO L93 Difference]: Finished difference Result 4261 states and 12569 transitions. [2022-11-23 13:54:10,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:10,043 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:10,050 INFO L225 Difference]: With dead ends: 4261 [2022-11-23 13:54:10,050 INFO L226 Difference]: Without dead ends: 4261 [2022-11-23 13:54:10,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:54:10,052 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 344 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:10,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 22 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3255 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-23 13:54:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2022-11-23 13:54:10,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4164. [2022-11-23 13:54:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4164 states, 4160 states have (on average 2.9663461538461537) internal successors, (12340), 4163 states have internal predecessors, (12340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4164 states to 4164 states and 12340 transitions. [2022-11-23 13:54:10,115 INFO L78 Accepts]: Start accepts. Automaton has 4164 states and 12340 transitions. Word has length 31 [2022-11-23 13:54:10,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:10,115 INFO L495 AbstractCegarLoop]: Abstraction has 4164 states and 12340 transitions. [2022-11-23 13:54:10,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4164 states and 12340 transitions. [2022-11-23 13:54:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:10,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:10,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:10,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-11-23 13:54:10,120 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:10,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1609633036, now seen corresponding path program 1 times [2022-11-23 13:54:10,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:10,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43303300] [2022-11-23 13:54:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:11,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:11,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43303300] [2022-11-23 13:54:11,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43303300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:11,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:11,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:54:11,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940251230] [2022-11-23 13:54:11,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:11,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:54:11,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:11,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:54:11,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:54:11,885 INFO L87 Difference]: Start difference. First operand 4164 states and 12340 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:15,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:15,869 INFO L93 Difference]: Finished difference Result 4663 states and 13755 transitions. [2022-11-23 13:54:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:54:15,869 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:15,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:15,876 INFO L225 Difference]: With dead ends: 4663 [2022-11-23 13:54:15,877 INFO L226 Difference]: Without dead ends: 4663 [2022-11-23 13:54:15,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:54:15,877 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 326 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:15,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 22 Invalid, 3156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3129 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-23 13:54:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4663 states. [2022-11-23 13:54:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4663 to 4452. [2022-11-23 13:54:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 4448 states have (on average 2.9678507194244603) internal successors, (13201), 4451 states have internal predecessors, (13201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 13201 transitions. [2022-11-23 13:54:15,937 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 13201 transitions. Word has length 31 [2022-11-23 13:54:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:15,937 INFO L495 AbstractCegarLoop]: Abstraction has 4452 states and 13201 transitions. [2022-11-23 13:54:15,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 13201 transitions. [2022-11-23 13:54:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:15,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:15,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:15,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-11-23 13:54:15,941 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:15,941 INFO L85 PathProgramCache]: Analyzing trace with hash -166392972, now seen corresponding path program 2 times [2022-11-23 13:54:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:15,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261894414] [2022-11-23 13:54:15,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:15,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:17,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:17,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:17,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261894414] [2022-11-23 13:54:17,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261894414] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:17,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:17,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:17,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271464703] [2022-11-23 13:54:17,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:17,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:17,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:17,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:17,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:17,712 INFO L87 Difference]: Start difference. First operand 4452 states and 13201 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:22,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:22,439 INFO L93 Difference]: Finished difference Result 5660 states and 16607 transitions. [2022-11-23 13:54:22,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:22,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:22,449 INFO L225 Difference]: With dead ends: 5660 [2022-11-23 13:54:22,449 INFO L226 Difference]: Without dead ends: 5660 [2022-11-23 13:54:22,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:54:22,449 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 343 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 3623 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:22,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 37 Invalid, 3649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3623 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 13:54:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5660 states. [2022-11-23 13:54:22,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5660 to 4474. [2022-11-23 13:54:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4474 states, 4470 states have (on average 2.968008948545861) internal successors, (13267), 4473 states have internal predecessors, (13267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 13267 transitions. [2022-11-23 13:54:22,519 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 13267 transitions. Word has length 31 [2022-11-23 13:54:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:22,519 INFO L495 AbstractCegarLoop]: Abstraction has 4474 states and 13267 transitions. [2022-11-23 13:54:22,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 13267 transitions. [2022-11-23 13:54:22,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:22,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:22,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:22,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-11-23 13:54:22,523 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:22,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1219794988, now seen corresponding path program 3 times [2022-11-23 13:54:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:22,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392509236] [2022-11-23 13:54:22,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:22,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:24,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:24,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392509236] [2022-11-23 13:54:24,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392509236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:24,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:24,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:24,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326998266] [2022-11-23 13:54:24,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:24,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:24,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:24,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:24,260 INFO L87 Difference]: Start difference. First operand 4474 states and 13267 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:28,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:28,874 INFO L93 Difference]: Finished difference Result 5622 states and 16505 transitions. [2022-11-23 13:54:28,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:28,875 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:28,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:28,884 INFO L225 Difference]: With dead ends: 5622 [2022-11-23 13:54:28,884 INFO L226 Difference]: Without dead ends: 5622 [2022-11-23 13:54:28,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:54:28,885 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 344 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 3664 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 3685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:28,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 46 Invalid, 3685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3664 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 13:54:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2022-11-23 13:54:28,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 4492. [2022-11-23 13:54:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4492 states, 4488 states have (on average 2.968137254901961) internal successors, (13321), 4491 states have internal predecessors, (13321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4492 states to 4492 states and 13321 transitions. [2022-11-23 13:54:28,956 INFO L78 Accepts]: Start accepts. Automaton has 4492 states and 13321 transitions. Word has length 31 [2022-11-23 13:54:28,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:28,957 INFO L495 AbstractCegarLoop]: Abstraction has 4492 states and 13321 transitions. [2022-11-23 13:54:28,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4492 states and 13321 transitions. [2022-11-23 13:54:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:28,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:28,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:28,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-11-23 13:54:28,961 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:28,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1454597522, now seen corresponding path program 4 times [2022-11-23 13:54:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:28,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950777336] [2022-11-23 13:54:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:28,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:30,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:30,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950777336] [2022-11-23 13:54:30,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950777336] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:30,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:30,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091428117] [2022-11-23 13:54:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:30,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:30,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:30,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:30,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:30,730 INFO L87 Difference]: Start difference. First operand 4492 states and 13321 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:35,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:35,610 INFO L93 Difference]: Finished difference Result 5578 states and 16397 transitions. [2022-11-23 13:54:35,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:35,611 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:35,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:35,620 INFO L225 Difference]: With dead ends: 5578 [2022-11-23 13:54:35,620 INFO L226 Difference]: Without dead ends: 5578 [2022-11-23 13:54:35,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:54:35,620 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 327 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3847 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:35,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 60 Invalid, 3867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3847 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-23 13:54:35,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2022-11-23 13:54:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4546. [2022-11-23 13:54:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4546 states, 4542 states have (on average 2.96257155438133) internal successors, (13456), 4545 states have internal predecessors, (13456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 13456 transitions. [2022-11-23 13:54:35,722 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 13456 transitions. Word has length 31 [2022-11-23 13:54:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:35,722 INFO L495 AbstractCegarLoop]: Abstraction has 4546 states and 13456 transitions. [2022-11-23 13:54:35,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 13456 transitions. [2022-11-23 13:54:35,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:35,727 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:35,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:35,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-11-23 13:54:35,728 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:35,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1388859130, now seen corresponding path program 5 times [2022-11-23 13:54:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:35,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828787593] [2022-11-23 13:54:35,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:35,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:37,448 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:37,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828787593] [2022-11-23 13:54:37,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828787593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:37,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:37,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085234453] [2022-11-23 13:54:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:37,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:37,449 INFO L87 Difference]: Start difference. First operand 4546 states and 13456 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:42,221 INFO L93 Difference]: Finished difference Result 5598 states and 16457 transitions. [2022-11-23 13:54:42,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:54:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:42,230 INFO L225 Difference]: With dead ends: 5598 [2022-11-23 13:54:42,230 INFO L226 Difference]: Without dead ends: 5598 [2022-11-23 13:54:42,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:54:42,231 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 365 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4047 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:42,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 85 Invalid, 4067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4047 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-23 13:54:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5598 states. [2022-11-23 13:54:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5598 to 4564. [2022-11-23 13:54:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4560 states have (on average 2.960745614035088) internal successors, (13501), 4563 states have internal predecessors, (13501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:42,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 13501 transitions. [2022-11-23 13:54:42,302 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 13501 transitions. Word has length 31 [2022-11-23 13:54:42,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:42,303 INFO L495 AbstractCegarLoop]: Abstraction has 4564 states and 13501 transitions. [2022-11-23 13:54:42,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:42,303 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 13501 transitions. [2022-11-23 13:54:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:42,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:42,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:54:42,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-11-23 13:54:42,306 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:42,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 904745278, now seen corresponding path program 6 times [2022-11-23 13:54:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:42,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650683243] [2022-11-23 13:54:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:42,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:43,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-11-23 13:54:43,834 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:43,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650683243] [2022-11-23 13:54:43,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650683243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:43,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:43,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:54:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790774011] [2022-11-23 13:54:43,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:43,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:54:43,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:43,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:54:43,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:54:43,835 INFO L87 Difference]: Start difference. First operand 4564 states and 13501 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:49,584 INFO L93 Difference]: Finished difference Result 5775 states and 16953 transitions. [2022-11-23 13:54:49,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 13:54:49,585 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:49,595 INFO L225 Difference]: With dead ends: 5775 [2022-11-23 13:54:49,595 INFO L226 Difference]: Without dead ends: 5775 [2022-11-23 13:54:49,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 13:54:49,596 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 398 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4743 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:49,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 99 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4743 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-23 13:54:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5775 states. [2022-11-23 13:54:49,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5775 to 4760. [2022-11-23 13:54:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4760 states, 4756 states have (on average 2.9539529015979813) internal successors, (14049), 4759 states have internal predecessors, (14049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4760 states to 4760 states and 14049 transitions. [2022-11-23 13:54:49,670 INFO L78 Accepts]: Start accepts. Automaton has 4760 states and 14049 transitions. Word has length 31 [2022-11-23 13:54:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:49,670 INFO L495 AbstractCegarLoop]: Abstraction has 4760 states and 14049 transitions. [2022-11-23 13:54:49,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4760 states and 14049 transitions. [2022-11-23 13:54:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:49,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:49,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, 1, 1, 1, 1, 1] [2022-11-23 13:54:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-11-23 13:54:49,675 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:49,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash -562648460, now seen corresponding path program 2 times [2022-11-23 13:54:49,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:49,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651721907] [2022-11-23 13:54:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:51,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-11-23 13:54:51,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:51,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651721907] [2022-11-23 13:54:51,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651721907] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:51,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:51,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:54:51,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100653946] [2022-11-23 13:54:51,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:51,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:54:51,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:51,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:54:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:54:51,272 INFO L87 Difference]: Start difference. First operand 4760 states and 14049 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:54:55,303 INFO L93 Difference]: Finished difference Result 5852 states and 17127 transitions. [2022-11-23 13:54:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:54:55,303 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:54:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:54:55,313 INFO L225 Difference]: With dead ends: 5852 [2022-11-23 13:54:55,313 INFO L226 Difference]: Without dead ends: 5852 [2022-11-23 13:54:55,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:54:55,314 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 323 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:54:55,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 33 Invalid, 3212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-23 13:54:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2022-11-23 13:54:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 4774. [2022-11-23 13:54:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4774 states, 4770 states have (on average 2.9540880503144655) internal successors, (14091), 4773 states have internal predecessors, (14091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4774 states to 4774 states and 14091 transitions. [2022-11-23 13:54:55,396 INFO L78 Accepts]: Start accepts. Automaton has 4774 states and 14091 transitions. Word has length 31 [2022-11-23 13:54:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:54:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 4774 states and 14091 transitions. [2022-11-23 13:54:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:54:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4774 states and 14091 transitions. [2022-11-23 13:54:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:54:55,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:54:55,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, 1, 1, 1, 1, 1] [2022-11-23 13:54:55,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-11-23 13:54:55,401 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:54:55,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:54:55,402 INFO L85 PathProgramCache]: Analyzing trace with hash 652652008, now seen corresponding path program 3 times [2022-11-23 13:54:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:54:55,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933197233] [2022-11-23 13:54:55,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:54:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:54:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:54:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:54:57,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:54:57,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933197233] [2022-11-23 13:54:57,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933197233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:54:57,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:54:57,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:54:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210628654] [2022-11-23 13:54:57,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:54:57,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:54:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:54:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:54:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:54:57,256 INFO L87 Difference]: Start difference. First operand 4774 states and 14091 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:01,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:01,453 INFO L93 Difference]: Finished difference Result 5804 states and 17007 transitions. [2022-11-23 13:55:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:55:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:01,463 INFO L225 Difference]: With dead ends: 5804 [2022-11-23 13:55:01,463 INFO L226 Difference]: Without dead ends: 5804 [2022-11-23 13:55:01,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:55:01,463 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 283 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 3549 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:01,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 48 Invalid, 3569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3549 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 13:55:01,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2022-11-23 13:55:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 4828. [2022-11-23 13:55:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4828 states, 4824 states have (on average 2.949004975124378) internal successors, (14226), 4827 states have internal predecessors, (14226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:01,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 14226 transitions. [2022-11-23 13:55:01,532 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 14226 transitions. Word has length 31 [2022-11-23 13:55:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:01,532 INFO L495 AbstractCegarLoop]: Abstraction has 4828 states and 14226 transitions. [2022-11-23 13:55:01,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 14226 transitions. [2022-11-23 13:55:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:01,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:01,537 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-11-23 13:55:01,537 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:01,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:01,537 INFO L85 PathProgramCache]: Analyzing trace with hash 30157180, now seen corresponding path program 4 times [2022-11-23 13:55:01,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144675889] [2022-11-23 13:55:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:03,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:03,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144675889] [2022-11-23 13:55:03,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144675889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:03,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:03,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:55:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315106255] [2022-11-23 13:55:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:03,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:55:03,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:55:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:55:03,293 INFO L87 Difference]: Start difference. First operand 4828 states and 14226 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:07,076 INFO L93 Difference]: Finished difference Result 5824 states and 17067 transitions. [2022-11-23 13:55:07,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:55:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:07,085 INFO L225 Difference]: With dead ends: 5824 [2022-11-23 13:55:07,085 INFO L226 Difference]: Without dead ends: 5824 [2022-11-23 13:55:07,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:55:07,086 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 347 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:07,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 59 Invalid, 3109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-23 13:55:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2022-11-23 13:55:07,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 4846. [2022-11-23 13:55:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4846 states, 4842 states have (on average 2.9473358116480792) internal successors, (14271), 4845 states have internal predecessors, (14271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4846 states to 4846 states and 14271 transitions. [2022-11-23 13:55:07,153 INFO L78 Accepts]: Start accepts. Automaton has 4846 states and 14271 transitions. Word has length 31 [2022-11-23 13:55:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:07,153 INFO L495 AbstractCegarLoop]: Abstraction has 4846 states and 14271 transitions. [2022-11-23 13:55:07,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:07,153 INFO L276 IsEmpty]: Start isEmpty. Operand 4846 states and 14271 transitions. [2022-11-23 13:55:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:07,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:07,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:07,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-11-23 13:55:07,157 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:07,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash -866334300, now seen corresponding path program 5 times [2022-11-23 13:55:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128736923] [2022-11-23 13:55:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:08,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:08,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128736923] [2022-11-23 13:55:08,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128736923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:08,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:08,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 13:55:08,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733796693] [2022-11-23 13:55:08,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:08,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:55:08,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:08,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:55:08,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:55:08,536 INFO L87 Difference]: Start difference. First operand 4846 states and 14271 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:12,539 INFO L93 Difference]: Finished difference Result 5770 states and 16876 transitions. [2022-11-23 13:55:12,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 13:55:12,540 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:12,549 INFO L225 Difference]: With dead ends: 5770 [2022-11-23 13:55:12,550 INFO L226 Difference]: Without dead ends: 5770 [2022-11-23 13:55:12,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:55:12,550 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 318 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 3721 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:12,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 86 Invalid, 3736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3721 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-23 13:55:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5770 states. [2022-11-23 13:55:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5770 to 5106. [2022-11-23 13:55:12,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5106 states, 5102 states have (on average 2.94453155625245) internal successors, (15023), 5105 states have internal predecessors, (15023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 15023 transitions. [2022-11-23 13:55:12,632 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 15023 transitions. Word has length 31 [2022-11-23 13:55:12,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:12,632 INFO L495 AbstractCegarLoop]: Abstraction has 5106 states and 15023 transitions. [2022-11-23 13:55:12,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 15023 transitions. [2022-11-23 13:55:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:12,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:12,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-11-23 13:55:12,637 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -669957914, now seen corresponding path program 7 times [2022-11-23 13:55:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:12,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67370349] [2022-11-23 13:55:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:14,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67370349] [2022-11-23 13:55:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67370349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:14,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:14,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:55:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53062444] [2022-11-23 13:55:14,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:14,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:55:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:55:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:55:14,256 INFO L87 Difference]: Start difference. First operand 5106 states and 15023 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:18,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:18,814 INFO L93 Difference]: Finished difference Result 5741 states and 16788 transitions. [2022-11-23 13:55:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:55:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:18,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:18,824 INFO L225 Difference]: With dead ends: 5741 [2022-11-23 13:55:18,824 INFO L226 Difference]: Without dead ends: 5741 [2022-11-23 13:55:18,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 13:55:18,824 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 356 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3870 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 3896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:18,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 93 Invalid, 3896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3870 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 13:55:18,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5741 states. [2022-11-23 13:55:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5741 to 5186. [2022-11-23 13:55:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5186 states, 5182 states have (on average 2.9376688537244307) internal successors, (15223), 5185 states have internal predecessors, (15223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 15223 transitions. [2022-11-23 13:55:18,905 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 15223 transitions. Word has length 31 [2022-11-23 13:55:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:18,906 INFO L495 AbstractCegarLoop]: Abstraction has 5186 states and 15223 transitions. [2022-11-23 13:55:18,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 15223 transitions. [2022-11-23 13:55:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:18,912 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:18,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:18,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-11-23 13:55:18,912 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1623646494, now seen corresponding path program 8 times [2022-11-23 13:55:18,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:18,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62159422] [2022-11-23 13:55:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:18,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:20,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:20,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62159422] [2022-11-23 13:55:20,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62159422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:20,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:20,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:55:20,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28917515] [2022-11-23 13:55:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:20,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:55:20,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:20,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:55:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:55:20,438 INFO L87 Difference]: Start difference. First operand 5186 states and 15223 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:27,018 INFO L93 Difference]: Finished difference Result 6608 states and 19335 transitions. [2022-11-23 13:55:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-23 13:55:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:27,030 INFO L225 Difference]: With dead ends: 6608 [2022-11-23 13:55:27,030 INFO L226 Difference]: Without dead ends: 6608 [2022-11-23 13:55:27,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2022-11-23 13:55:27,031 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 331 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5757 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 5779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:27,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 127 Invalid, 5779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5757 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-23 13:55:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6608 states. [2022-11-23 13:55:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6608 to 5180. [2022-11-23 13:55:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5176 states have (on average 2.9404945904173108) internal successors, (15220), 5179 states have internal predecessors, (15220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 15220 transitions. [2022-11-23 13:55:27,114 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 15220 transitions. Word has length 31 [2022-11-23 13:55:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:27,115 INFO L495 AbstractCegarLoop]: Abstraction has 5180 states and 15220 transitions. [2022-11-23 13:55:27,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 15220 transitions. [2022-11-23 13:55:27,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:27,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:27,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-11-23 13:55:27,119 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1856263296, now seen corresponding path program 9 times [2022-11-23 13:55:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:27,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935658730] [2022-11-23 13:55:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:27,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:28,547 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:28,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935658730] [2022-11-23 13:55:28,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935658730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:28,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:28,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:55:28,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516263753] [2022-11-23 13:55:28,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:28,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:55:28,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:28,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:55:28,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:55:28,549 INFO L87 Difference]: Start difference. First operand 5180 states and 15220 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:32,522 INFO L93 Difference]: Finished difference Result 5931 states and 17357 transitions. [2022-11-23 13:55:32,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:55:32,522 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:32,533 INFO L225 Difference]: With dead ends: 5931 [2022-11-23 13:55:32,533 INFO L226 Difference]: Without dead ends: 5931 [2022-11-23 13:55:32,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:55:32,534 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 380 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3647 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:32,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 105 Invalid, 3671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3647 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 13:55:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2022-11-23 13:55:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5388. [2022-11-23 13:55:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5388 states, 5384 states have (on average 2.9398216939078754) internal successors, (15828), 5387 states have internal predecessors, (15828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5388 states to 5388 states and 15828 transitions. [2022-11-23 13:55:32,623 INFO L78 Accepts]: Start accepts. Automaton has 5388 states and 15828 transitions. Word has length 31 [2022-11-23 13:55:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:32,624 INFO L495 AbstractCegarLoop]: Abstraction has 5388 states and 15828 transitions. [2022-11-23 13:55:32,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 5388 states and 15828 transitions. [2022-11-23 13:55:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:32,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:32,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:32,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-11-23 13:55:32,629 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1281816960, now seen corresponding path program 10 times [2022-11-23 13:55:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:32,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696293027] [2022-11-23 13:55:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:34,090 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:34,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696293027] [2022-11-23 13:55:34,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696293027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:34,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:34,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:55:34,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337705214] [2022-11-23 13:55:34,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:34,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:55:34,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:34,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:55:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:55:34,092 INFO L87 Difference]: Start difference. First operand 5388 states and 15828 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:39,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:39,729 INFO L93 Difference]: Finished difference Result 6343 states and 18535 transitions. [2022-11-23 13:55:39,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-23 13:55:39,729 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:39,740 INFO L225 Difference]: With dead ends: 6343 [2022-11-23 13:55:39,740 INFO L226 Difference]: Without dead ends: 6343 [2022-11-23 13:55:39,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=210, Invalid=1272, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 13:55:39,741 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 342 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4492 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 4517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:39,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 122 Invalid, 4517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4492 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-23 13:55:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6343 states. [2022-11-23 13:55:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6343 to 5428. [2022-11-23 13:55:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5428 states, 5424 states have (on average 2.946533923303835) internal successors, (15982), 5427 states have internal predecessors, (15982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:39,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 15982 transitions. [2022-11-23 13:55:39,826 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 15982 transitions. Word has length 31 [2022-11-23 13:55:39,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:39,827 INFO L495 AbstractCegarLoop]: Abstraction has 5428 states and 15982 transitions. [2022-11-23 13:55:39,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:39,827 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 15982 transitions. [2022-11-23 13:55:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:39,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:39,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:39,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2022-11-23 13:55:39,832 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:39,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1679061120, now seen corresponding path program 11 times [2022-11-23 13:55:39,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:39,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061884025] [2022-11-23 13:55:39,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:39,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:41,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:41,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061884025] [2022-11-23 13:55:41,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061884025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:41,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:41,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:55:41,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842066431] [2022-11-23 13:55:41,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:41,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:55:41,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:41,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:55:41,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:55:41,368 INFO L87 Difference]: Start difference. First operand 5428 states and 15982 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:45,802 INFO L93 Difference]: Finished difference Result 6371 states and 18574 transitions. [2022-11-23 13:55:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:55:45,803 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:45,815 INFO L225 Difference]: With dead ends: 6371 [2022-11-23 13:55:45,815 INFO L226 Difference]: Without dead ends: 6371 [2022-11-23 13:55:45,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:55:45,816 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 407 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 3808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:45,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 106 Invalid, 3808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-23 13:55:45,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6371 states. [2022-11-23 13:55:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6371 to 5502. [2022-11-23 13:55:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5502 states, 5498 states have (on average 2.9428883230265552) internal successors, (16180), 5501 states have internal predecessors, (16180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:45,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5502 states to 5502 states and 16180 transitions. [2022-11-23 13:55:45,927 INFO L78 Accepts]: Start accepts. Automaton has 5502 states and 16180 transitions. Word has length 31 [2022-11-23 13:55:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:45,928 INFO L495 AbstractCegarLoop]: Abstraction has 5502 states and 16180 transitions. [2022-11-23 13:55:45,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 5502 states and 16180 transitions. [2022-11-23 13:55:45,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:45,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:45,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:45,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2022-11-23 13:55:45,934 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:45,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash -637918746, now seen corresponding path program 12 times [2022-11-23 13:55:45,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:45,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642781625] [2022-11-23 13:55:45,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:45,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:47,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642781625] [2022-11-23 13:55:47,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642781625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:47,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:47,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-23 13:55:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471601707] [2022-11-23 13:55:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:47,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-23 13:55:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-23 13:55:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2022-11-23 13:55:47,584 INFO L87 Difference]: Start difference. First operand 5502 states and 16180 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:52,793 INFO L93 Difference]: Finished difference Result 6309 states and 18368 transitions. [2022-11-23 13:55:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 13:55:52,794 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:52,804 INFO L225 Difference]: With dead ends: 6309 [2022-11-23 13:55:52,805 INFO L226 Difference]: Without dead ends: 6309 [2022-11-23 13:55:52,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=203, Invalid=1203, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 13:55:52,805 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 425 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4088 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 4112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:52,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 106 Invalid, 4112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4088 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-11-23 13:55:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6309 states. [2022-11-23 13:55:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6309 to 5148. [2022-11-23 13:55:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5148 states, 5144 states have (on average 2.9500388802488335) internal successors, (15175), 5147 states have internal predecessors, (15175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5148 states to 5148 states and 15175 transitions. [2022-11-23 13:55:52,888 INFO L78 Accepts]: Start accepts. Automaton has 5148 states and 15175 transitions. Word has length 31 [2022-11-23 13:55:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:52,888 INFO L495 AbstractCegarLoop]: Abstraction has 5148 states and 15175 transitions. [2022-11-23 13:55:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5148 states and 15175 transitions. [2022-11-23 13:55:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:52,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:52,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:52,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2022-11-23 13:55:52,893 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:52,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 945919532, now seen corresponding path program 6 times [2022-11-23 13:55:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:52,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867104286] [2022-11-23 13:55:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:52,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:55:54,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:55:54,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:55:54,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867104286] [2022-11-23 13:55:54,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867104286] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:55:54,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:55:54,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:55:54,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346860174] [2022-11-23 13:55:54,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:55:54,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:55:54,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:55:54,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:55:54,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:55:54,404 INFO L87 Difference]: Start difference. First operand 5148 states and 15175 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:55:58,333 INFO L93 Difference]: Finished difference Result 5713 states and 16712 transitions. [2022-11-23 13:55:58,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:55:58,333 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:55:58,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:55:58,344 INFO L225 Difference]: With dead ends: 5713 [2022-11-23 13:55:58,344 INFO L226 Difference]: Without dead ends: 5713 [2022-11-23 13:55:58,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:55:58,344 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 346 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 3233 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 3258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:55:58,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 44 Invalid, 3258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3233 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-23 13:55:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states. [2022-11-23 13:55:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 5146. [2022-11-23 13:55:58,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5142 states have (on average 2.9500194476857255) internal successors, (15169), 5145 states have internal predecessors, (15169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 15169 transitions. [2022-11-23 13:55:58,434 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 15169 transitions. Word has length 31 [2022-11-23 13:55:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:55:58,435 INFO L495 AbstractCegarLoop]: Abstraction has 5146 states and 15169 transitions. [2022-11-23 13:55:58,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:55:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 15169 transitions. [2022-11-23 13:55:58,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:55:58,440 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:55:58,440 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:55:58,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2022-11-23 13:55:58,440 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:55:58,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:55:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2133747296, now seen corresponding path program 7 times [2022-11-23 13:55:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:55:58,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041737394] [2022-11-23 13:55:58,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:55:58,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:55:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:00,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-11-23 13:56:00,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041737394] [2022-11-23 13:56:00,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041737394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:00,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:00,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:56:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010140529] [2022-11-23 13:56:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:00,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:56:00,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:00,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:56:00,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:56:00,110 INFO L87 Difference]: Start difference. First operand 5146 states and 15169 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:03,992 INFO L93 Difference]: Finished difference Result 6236 states and 18217 transitions. [2022-11-23 13:56:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:56:03,993 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:56:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:04,004 INFO L225 Difference]: With dead ends: 6236 [2022-11-23 13:56:04,005 INFO L226 Difference]: Without dead ends: 6236 [2022-11-23 13:56:04,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:56:04,005 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 334 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:04,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 58 Invalid, 3494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3470 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-23 13:56:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6236 states. [2022-11-23 13:56:04,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6236 to 5200. [2022-11-23 13:56:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 5196 states have (on average 2.945342571208622) internal successors, (15304), 5199 states have internal predecessors, (15304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 15304 transitions. [2022-11-23 13:56:04,096 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 15304 transitions. Word has length 31 [2022-11-23 13:56:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:04,096 INFO L495 AbstractCegarLoop]: Abstraction has 5200 states and 15304 transitions. [2022-11-23 13:56:04,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 15304 transitions. [2022-11-23 13:56:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:56:04,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:04,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:04,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2022-11-23 13:56:04,102 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:04,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:04,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1538725172, now seen corresponding path program 8 times [2022-11-23 13:56:04,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:04,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866819806] [2022-11-23 13:56:04,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:04,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:05,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:05,516 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:05,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866819806] [2022-11-23 13:56:05,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866819806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:05,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:05,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 13:56:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221925405] [2022-11-23 13:56:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:05,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:56:05,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:56:05,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:56:05,518 INFO L87 Difference]: Start difference. First operand 5200 states and 15304 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:10,323 INFO L93 Difference]: Finished difference Result 6470 states and 18894 transitions. [2022-11-23 13:56:10,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 13:56:10,323 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:56:10,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:10,336 INFO L225 Difference]: With dead ends: 6470 [2022-11-23 13:56:10,336 INFO L226 Difference]: Without dead ends: 6470 [2022-11-23 13:56:10,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:56:10,337 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 307 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4017 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:10,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 102 Invalid, 4032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4017 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-23 13:56:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6470 states. [2022-11-23 13:56:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6470 to 5128. [2022-11-23 13:56:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5128 states, 5124 states have (on average 2.9498438719750197) internal successors, (15115), 5127 states have internal predecessors, (15115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5128 states to 5128 states and 15115 transitions. [2022-11-23 13:56:10,427 INFO L78 Accepts]: Start accepts. Automaton has 5128 states and 15115 transitions. Word has length 31 [2022-11-23 13:56:10,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:10,428 INFO L495 AbstractCegarLoop]: Abstraction has 5128 states and 15115 transitions. [2022-11-23 13:56:10,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5128 states and 15115 transitions. [2022-11-23 13:56:10,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:56:10,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:10,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:10,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2022-11-23 13:56:10,434 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:10,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1477158598, now seen corresponding path program 9 times [2022-11-23 13:56:10,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:10,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506502581] [2022-11-23 13:56:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:10,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:11,995 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:11,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506502581] [2022-11-23 13:56:11,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506502581] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:11,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:11,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-23 13:56:11,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934149445] [2022-11-23 13:56:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:11,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-23 13:56:11,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:11,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-23 13:56:11,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2022-11-23 13:56:11,997 INFO L87 Difference]: Start difference. First operand 5128 states and 15115 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:16,465 INFO L93 Difference]: Finished difference Result 5879 states and 17252 transitions. [2022-11-23 13:56:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 13:56:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:56:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:16,475 INFO L225 Difference]: With dead ends: 5879 [2022-11-23 13:56:16,476 INFO L226 Difference]: Without dead ends: 5879 [2022-11-23 13:56:16,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:56:16,476 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 354 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4136 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 4160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:16,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 119 Invalid, 4160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4136 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-23 13:56:16,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5879 states. [2022-11-23 13:56:16,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5879 to 5068. [2022-11-23 13:56:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5068 states, 5064 states have (on average 2.955173775671406) internal successors, (14965), 5067 states have internal predecessors, (14965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:16,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 14965 transitions. [2022-11-23 13:56:16,564 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 14965 transitions. Word has length 31 [2022-11-23 13:56:16,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:16,565 INFO L495 AbstractCegarLoop]: Abstraction has 5068 states and 14965 transitions. [2022-11-23 13:56:16,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:16,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 14965 transitions. [2022-11-23 13:56:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:56:16,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:16,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:16,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2022-11-23 13:56:16,571 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:16,571 INFO L85 PathProgramCache]: Analyzing trace with hash -906127332, now seen corresponding path program 10 times [2022-11-23 13:56:16,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:16,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803928344] [2022-11-23 13:56:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:17,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-11-23 13:56:17,756 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803928344] [2022-11-23 13:56:17,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803928344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:17,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:17,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 13:56:17,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820740594] [2022-11-23 13:56:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:17,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:56:17,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:56:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:56:17,758 INFO L87 Difference]: Start difference. First operand 5068 states and 14965 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:22,070 INFO L93 Difference]: Finished difference Result 6178 states and 18105 transitions. [2022-11-23 13:56:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 13:56:22,070 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:56:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:22,081 INFO L225 Difference]: With dead ends: 6178 [2022-11-23 13:56:22,081 INFO L226 Difference]: Without dead ends: 6178 [2022-11-23 13:56:22,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2022-11-23 13:56:22,082 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 420 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:22,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 91 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3559 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-23 13:56:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2022-11-23 13:56:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 5056. [2022-11-23 13:56:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5052 states have (on average 2.9526920031670625) internal successors, (14917), 5055 states have internal predecessors, (14917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:22,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 14917 transitions. [2022-11-23 13:56:22,161 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 14917 transitions. Word has length 31 [2022-11-23 13:56:22,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:22,162 INFO L495 AbstractCegarLoop]: Abstraction has 5056 states and 14917 transitions. [2022-11-23 13:56:22,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 14917 transitions. [2022-11-23 13:56:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 13:56:22,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:22,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:22,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2022-11-23 13:56:22,167 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1206195706, now seen corresponding path program 11 times [2022-11-23 13:56:22,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:22,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341014228] [2022-11-23 13:56:22,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:22,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:23,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341014228] [2022-11-23 13:56:23,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341014228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 13:56:23,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 13:56:23,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-23 13:56:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663260767] [2022-11-23 13:56:23,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:23,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 13:56:23,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:23,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 13:56:23,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-11-23 13:56:23,479 INFO L87 Difference]: Start difference. First operand 5056 states and 14917 transitions. Second operand has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:27,309 INFO L93 Difference]: Finished difference Result 5379 states and 15819 transitions. [2022-11-23 13:56:27,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-23 13:56:27,310 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2022-11-23 13:56:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:27,318 INFO L225 Difference]: With dead ends: 5379 [2022-11-23 13:56:27,318 INFO L226 Difference]: Without dead ends: 5379 [2022-11-23 13:56:27,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 13:56:27,319 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 357 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3516 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:27,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 92 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3516 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-23 13:56:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5379 states. [2022-11-23 13:56:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5379 to 4628. [2022-11-23 13:56:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4628 states, 4624 states have (on average 2.9589100346020762) internal successors, (13682), 4627 states have internal predecessors, (13682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4628 states to 4628 states and 13682 transitions. [2022-11-23 13:56:27,383 INFO L78 Accepts]: Start accepts. Automaton has 4628 states and 13682 transitions. Word has length 31 [2022-11-23 13:56:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:27,383 INFO L495 AbstractCegarLoop]: Abstraction has 4628 states and 13682 transitions. [2022-11-23 13:56:27,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:27,384 INFO L276 IsEmpty]: Start isEmpty. Operand 4628 states and 13682 transitions. [2022-11-23 13:56:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 13:56:27,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:27,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2022-11-23 13:56:27,388 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1115249222, now seen corresponding path program 1 times [2022-11-23 13:56:27,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:27,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861141607] [2022-11-23 13:56:27,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:28,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:28,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861141607] [2022-11-23 13:56:28,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861141607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:28,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817446158] [2022-11-23 13:56:28,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:28,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:28,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:28,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:28,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 13:56:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:28,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 13:56:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:56:28,434 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 13:56:28,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 13:56:28,550 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 13:56:28,550 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:56:28,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-23 13:56:28,928 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-11-23 13:56:28,952 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-11-23 13:56:29,104 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-11-23 13:56:29,171 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 13:56:29,171 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 29 [2022-11-23 13:56:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:29,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:56:29,840 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 13:56:34,975 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 371 treesize of output 365 [2022-11-23 13:56:34,981 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:56:34,984 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 330 treesize of output 322 [2022-11-23 13:56:34,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:56:34,995 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 308 treesize of output 304 [2022-11-23 13:56:35,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:56:35,011 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 297 treesize of output 291 [2022-11-23 13:56:35,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:56:35,020 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 230 treesize of output 214 [2022-11-23 13:56:35,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:35,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817446158] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:35,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:56:35,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 41 [2022-11-23 13:56:35,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481105053] [2022-11-23 13:56:35,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:56:35,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:56:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:56:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:56:35,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1524, Unknown=55, NotChecked=80, Total=1806 [2022-11-23 13:56:35,180 INFO L87 Difference]: Start difference. First operand 4628 states and 13682 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:39,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:39,653 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 13:56:42,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:43,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:46,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:48,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:50,411 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:56:51,158 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:56:51,174 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:56:51,684 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:56:53,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:56:53,950 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:56:54,061 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2782) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:56:55,934 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2784 Int) (v_ArrVal_2783 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2783) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2784 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2784) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:56:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:56:58,114 INFO L93 Difference]: Finished difference Result 8183 states and 23661 transitions. [2022-11-23 13:56:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 13:56:58,115 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 13:56:58,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:56:58,132 INFO L225 Difference]: With dead ends: 8183 [2022-11-23 13:56:58,132 INFO L226 Difference]: Without dead ends: 8183 [2022-11-23 13:56:58,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=230, Invalid=2229, Unknown=229, NotChecked=972, Total=3660 [2022-11-23 13:56:58,132 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 415 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 35 mSolverCounterUnsat, 828 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 2967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 828 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2022-11-23 13:56:58,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 86 Invalid, 2967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1568 Invalid, 828 Unknown, 536 Unchecked, 20.3s Time] [2022-11-23 13:56:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8183 states. [2022-11-23 13:56:58,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8183 to 5077. [2022-11-23 13:56:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5077 states, 5073 states have (on average 2.9436231027005717) internal successors, (14933), 5076 states have internal predecessors, (14933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:58,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5077 states to 5077 states and 14933 transitions. [2022-11-23 13:56:58,241 INFO L78 Accepts]: Start accepts. Automaton has 5077 states and 14933 transitions. Word has length 32 [2022-11-23 13:56:58,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:56:58,241 INFO L495 AbstractCegarLoop]: Abstraction has 5077 states and 14933 transitions. [2022-11-23 13:56:58,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:56:58,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5077 states and 14933 transitions. [2022-11-23 13:56:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 13:56:58,246 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:56:58,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:56:58,254 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 13:56:58,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:58,447 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:56:58,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:56:58,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1640979622, now seen corresponding path program 1 times [2022-11-23 13:56:58,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:56:58,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128229331] [2022-11-23 13:56:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:58,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:56:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:56:59,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:56:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128229331] [2022-11-23 13:56:59,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128229331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:56:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517388267] [2022-11-23 13:56:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:56:59,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:56:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:56:59,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:56:59,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-23 13:56:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:56:59,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-23 13:56:59,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:56:59,602 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2022-11-23 13:56:59,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 23 [2022-11-23 13:56:59,694 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 13:56:59,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:56:59,820 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 14 treesize of output 16 [2022-11-23 13:57:00,005 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-11-23 13:57:00,034 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-11-23 13:57:00,170 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-11-23 13:57:00,229 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 13:57:00,229 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 29 [2022-11-23 13:57:00,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:00,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:00,716 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 13:57:00,849 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 13:57:01,528 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 743 treesize of output 733 [2022-11-23 13:57:01,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:01,539 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 670 treesize of output 654 [2022-11-23 13:57:01,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:01,557 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 626 treesize of output 618 [2022-11-23 13:57:01,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:01,569 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 506 treesize of output 474 [2022-11-23 13:57:01,577 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:01,579 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 453 treesize of output 443 [2022-11-23 13:57:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:01,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517388267] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:01,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:57:01,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 38 [2022-11-23 13:57:01,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565748870] [2022-11-23 13:57:01,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:57:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 13:57:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 13:57:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1232, Unknown=47, NotChecked=146, Total=1560 [2022-11-23 13:57:01,716 INFO L87 Difference]: Start difference. First operand 5077 states and 14933 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:04,224 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 13:57:04,398 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:04,998 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:05,374 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:05,441 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:05,483 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 13:57:05,760 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:06,040 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:06,108 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:08,609 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-11-23 13:57:08,881 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_ring_enqueue_~r#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:10,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 13:57:11,225 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:12,241 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:12,636 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:12,783 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:12,969 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2851 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2851) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:14,207 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_2856 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:14,277 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2853 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_writer_fn_~r~1#1.base| v_ArrVal_2853) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2854 (Array Int Int)) (v_ArrVal_2856 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2854) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2856) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:15,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:15,249 INFO L93 Difference]: Finished difference Result 10385 states and 30010 transitions. [2022-11-23 13:57:15,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-23 13:57:15,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 13:57:15,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:15,270 INFO L225 Difference]: With dead ends: 10385 [2022-11-23 13:57:15,271 INFO L226 Difference]: Without dead ends: 10385 [2022-11-23 13:57:15,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=215, Invalid=1674, Unknown=167, NotChecked=1976, Total=4032 [2022-11-23 13:57:15,271 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 292 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 36 mSolverCounterUnsat, 481 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 481 IncrementalHoareTripleChecker+Unknown, 636 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:15,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 52 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1307 Invalid, 481 Unknown, 636 Unchecked, 9.2s Time] [2022-11-23 13:57:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10385 states. [2022-11-23 13:57:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10385 to 5855. [2022-11-23 13:57:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5855 states, 5851 states have (on average 2.9707742266279267) internal successors, (17382), 5854 states have internal predecessors, (17382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:15,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 17382 transitions. [2022-11-23 13:57:15,443 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 17382 transitions. Word has length 32 [2022-11-23 13:57:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:15,443 INFO L495 AbstractCegarLoop]: Abstraction has 5855 states and 17382 transitions. [2022-11-23 13:57:15,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 17382 transitions. [2022-11-23 13:57:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 13:57:15,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:15,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:15,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-23 13:57:15,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-11-23 13:57:15,655 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:57:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2142846408, now seen corresponding path program 2 times [2022-11-23 13:57:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:15,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403076332] [2022-11-23 13:57:15,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:16,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:16,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:16,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403076332] [2022-11-23 13:57:16,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403076332] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:16,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322534250] [2022-11-23 13:57:16,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 13:57:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:16,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:16,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:16,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-23 13:57:16,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 13:57:16,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:16,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-23 13:57:16,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:16,799 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 13:57:16,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-23 13:57:16,901 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 13:57:16,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:57:17,012 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 14 treesize of output 16 [2022-11-23 13:57:17,230 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-11-23 13:57:17,249 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-11-23 13:57:17,385 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-11-23 13:57:17,441 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 13:57:17,442 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 29 [2022-11-23 13:57:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:17,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:24,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 13:57:25,036 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 743 treesize of output 733 [2022-11-23 13:57:25,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:25,052 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 614 treesize of output 582 [2022-11-23 13:57:25,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:25,064 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 554 treesize of output 546 [2022-11-23 13:57:25,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:25,075 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 525 treesize of output 515 [2022-11-23 13:57:25,084 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:25,088 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 454 treesize of output 438 [2022-11-23 13:57:25,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:25,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322534250] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:25,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 13:57:25,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 41 [2022-11-23 13:57:25,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695619772] [2022-11-23 13:57:25,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 13:57:25,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 13:57:25,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:57:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 13:57:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1502, Unknown=76, NotChecked=80, Total=1806 [2022-11-23 13:57:25,292 INFO L87 Difference]: Start difference. First operand 5855 states and 17382 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:26,511 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 13:57:28,711 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-11-23 13:57:30,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 [1] [2022-11-23 13:57:31,967 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:32,058 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:32,270 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0)) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-23 13:57:32,479 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:34,019 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:34,172 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 13:57:37,072 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (v_ArrVal_2927 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_2927) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:38,099 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:38,187 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:38,226 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:39,038 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2929 Int) (v_ArrVal_2928 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_2928) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_2929 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_2929) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 13:57:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 13:57:40,126 INFO L93 Difference]: Finished difference Result 9565 states and 27612 transitions. [2022-11-23 13:57:40,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 13:57:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 13:57:40,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 13:57:40,146 INFO L225 Difference]: With dead ends: 9565 [2022-11-23 13:57:40,146 INFO L226 Difference]: Without dead ends: 9565 [2022-11-23 13:57:40,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=210, Invalid=2003, Unknown=191, NotChecked=1378, Total=3782 [2022-11-23 13:57:40,147 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 362 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 37 mSolverCounterUnsat, 566 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 566 IncrementalHoareTripleChecker+Unknown, 978 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-11-23 13:57:40,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 59 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1413 Invalid, 566 Unknown, 978 Unchecked, 10.8s Time] [2022-11-23 13:57:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9565 states. [2022-11-23 13:57:40,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9565 to 6256. [2022-11-23 13:57:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6256 states, 6252 states have (on average 2.964011516314779) internal successors, (18531), 6255 states have internal predecessors, (18531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6256 states to 6256 states and 18531 transitions. [2022-11-23 13:57:40,308 INFO L78 Accepts]: Start accepts. Automaton has 6256 states and 18531 transitions. Word has length 32 [2022-11-23 13:57:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 13:57:40,308 INFO L495 AbstractCegarLoop]: Abstraction has 6256 states and 18531 transitions. [2022-11-23 13:57:40,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 13:57:40,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6256 states and 18531 transitions. [2022-11-23 13:57:40,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 13:57:40,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 13:57:40,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 13:57:40,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-23 13:57:40,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-11-23 13:57:40,524 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 13:57:40,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 13:57:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1542807466, now seen corresponding path program 3 times [2022-11-23 13:57:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 13:57:40,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707021954] [2022-11-23 13:57:40,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 13:57:40,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 13:57:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 13:57:41,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:41,318 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 13:57:41,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707021954] [2022-11-23 13:57:41,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707021954] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 13:57:41,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426624325] [2022-11-23 13:57:41,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 13:57:41,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 13:57:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 13:57:41,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 13:57:41,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-23 13:57:41,590 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 13:57:41,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 13:57:41,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-23 13:57:41,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 13:57:41,626 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 13:57:41,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 16 [2022-11-23 13:57:41,742 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-23 13:57:41,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 13:57:41,960 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-11-23 13:57:42,274 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-11-23 13:57:42,308 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-11-23 13:57:42,574 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-11-23 13:57:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 13:57:42,811 INFO L321 Elim1Store]: treesize reduction 30, result has 62.0 percent of original size [2022-11-23 13:57:42,812 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 5 case distinctions, treesize of input 47 treesize of output 72 [2022-11-23 13:57:43,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:57:43,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 13:57:43,774 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:43,836 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,066 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,237 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,268 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse0 (store .cse1 .cse2 v_ArrVal_3002))) (or (< (select .cse0 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (< (+ (select .cse1 .cse2) 1) v_ArrVal_3002) (not (< 0 (select .cse0 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2998 (Array Int Int)) (v_ArrVal_3000 (Array Int Int)) (v_ArrVal_3001 (Array Int Int)) (|v_reader_twoThread1of1ForFork1_~val~1#1_364| Int) (v_ArrVal_3002 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_2998) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3000) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3001) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|)) (.cse1 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (- 4) (* 4 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))) (let ((.cse2 (store .cse0 .cse1 v_ArrVal_3002))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_3002) (< (select .cse2 (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| 4)) 3) (not (< 0 (select .cse2 |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (not (< 1 |v_reader_twoThread1of1ForFork1_~val~1#1_364|)))))) is different from false [2022-11-23 13:57:44,687 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 1053 treesize of output 1037 [2022-11-23 13:57:44,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:44,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1049 treesize of output 979 [2022-11-23 13:57:44,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:44,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 635 treesize of output 625 [2022-11-23 13:57:44,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:44,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 973 treesize of output 959 [2022-11-23 13:57:44,840 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 13:57:44,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 13:57:44,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 953 treesize of output 923 [2022-11-23 13:59:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 13:59:06,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426624325] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 13:59:06,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375986782] [2022-11-23 13:59:06,838 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:336) 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-11-23 13:59:06,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 13:59:06,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2022-11-23 13:59:06,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973568275] [2022-11-23 13:59:06,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 13:59:06,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-23 13:59:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 13:59:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-23 13:59:06,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1383, Unknown=10, NotChecked=574, Total=2162 [2022-11-23 13:59:06,840 INFO L87 Difference]: Start difference. First operand 6256 states and 18531 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 46 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-11-23 13:59:25,771 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-11-23 13:59:29,091 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-11-23 13:59:59,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:00:01,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:00:16,196 WARN L233 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 93 DAG size of output: 80 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:00:40,793 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 94 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:00:54,663 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 107 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-23 14:00:58,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 [1] [2022-11-23 14:01:01,175 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-11-23 14:01:03,872 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-11-23 14:01:06,388 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-11-23 14:01:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:01:08,375 INFO L93 Difference]: Finished difference Result 22377 states and 66697 transitions. [2022-11-23 14:01:08,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-23 14:01:08,375 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 46 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) Word has length 32 [2022-11-23 14:01:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:01:08,425 INFO L225 Difference]: With dead ends: 22377 [2022-11-23 14:01:08,425 INFO L226 Difference]: Without dead ends: 22377 [2022-11-23 14:01:08,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 34 SyntacticMatches, 21 SemanticMatches, 103 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 91.1s TimeCoverageRelationStatistics Valid=2085, Invalid=7426, Unknown=23, NotChecked=1386, Total=10920 [2022-11-23 14:01:08,426 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1729 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 10821 mSolverCounterSat, 238 mSolverCounterUnsat, 108 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 15330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 10821 IncrementalHoareTripleChecker+Invalid, 108 IncrementalHoareTripleChecker+Unknown, 4163 IncrementalHoareTripleChecker+Unchecked, 31.7s IncrementalHoareTripleChecker+Time [2022-11-23 14:01:08,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 128 Invalid, 15330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [238 Valid, 10821 Invalid, 108 Unknown, 4163 Unchecked, 31.7s Time] [2022-11-23 14:01:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22377 states. [2022-11-23 14:01:08,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22377 to 15941. [2022-11-23 14:01:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15941 states, 15937 states have (on average 3.0340089100834535) internal successors, (48353), 15940 states have internal predecessors, (48353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15941 states to 15941 states and 48353 transitions. [2022-11-23 14:01:08,840 INFO L78 Accepts]: Start accepts. Automaton has 15941 states and 48353 transitions. Word has length 32 [2022-11-23 14:01:08,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:01:08,841 INFO L495 AbstractCegarLoop]: Abstraction has 15941 states and 48353 transitions. [2022-11-23 14:01:08,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 46 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-11-23 14:01:08,841 INFO L276 IsEmpty]: Start isEmpty. Operand 15941 states and 48353 transitions. [2022-11-23 14:01:08,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:01:08,854 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:01:08,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:01:08,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-23 14:01:09,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:09,055 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:01:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:01:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -262229262, now seen corresponding path program 2 times [2022-11-23 14:01:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:01:09,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740182681] [2022-11-23 14:01:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:01:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:09,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:09,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:01:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740182681] [2022-11-23 14:01:09,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740182681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694358558] [2022-11-23 14:01:09,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:01:09,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:09,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:01:09,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:01:09,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-23 14:01:10,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:01:10,025 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:01:10,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-23 14:01:10,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:01:10,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:10,042 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-11-23 14:01:10,047 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-11-23 14:01:10,051 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-11-23 14:01:10,293 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-11-23 14:01:10,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:10,614 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 14:01:10,614 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-11-23 14:01:10,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:10,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:10,696 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-23 14:01:10,697 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-11-23 14:01:10,848 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 14:01:10,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:01:11,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:11,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:01:11,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694358558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:01:11,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:01:11,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [14] total 30 [2022-11-23 14:01:11,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672748510] [2022-11-23 14:01:11,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:01:11,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-23 14:01:11,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:01:11,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-23 14:01:11,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=909, Unknown=0, NotChecked=0, Total=992 [2022-11-23 14:01:11,038 INFO L87 Difference]: Start difference. First operand 15941 states and 48353 transitions. Second operand has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:01:14,514 INFO L93 Difference]: Finished difference Result 19500 states and 58818 transitions. [2022-11-23 14:01:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-23 14:01:14,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:01:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:01:14,561 INFO L225 Difference]: With dead ends: 19500 [2022-11-23 14:01:14,561 INFO L226 Difference]: Without dead ends: 19500 [2022-11-23 14:01:14,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=189, Invalid=1791, Unknown=0, NotChecked=0, Total=1980 [2022-11-23 14:01:14,562 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 467 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3244 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:01:14,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 129 Invalid, 3263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3244 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-23 14:01:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19500 states. [2022-11-23 14:01:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19500 to 17291. [2022-11-23 14:01:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17291 states, 17287 states have (on average 3.0328570602186615) internal successors, (52429), 17290 states have internal predecessors, (52429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17291 states to 17291 states and 52429 transitions. [2022-11-23 14:01:14,985 INFO L78 Accepts]: Start accepts. Automaton has 17291 states and 52429 transitions. Word has length 32 [2022-11-23 14:01:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:01:14,985 INFO L495 AbstractCegarLoop]: Abstraction has 17291 states and 52429 transitions. [2022-11-23 14:01:14,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 17291 states and 52429 transitions. [2022-11-23 14:01:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:01:15,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:01:15,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:01:15,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-23 14:01:15,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:15,202 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:01:15,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:01:15,203 INFO L85 PathProgramCache]: Analyzing trace with hash -307872998, now seen corresponding path program 4 times [2022-11-23 14:01:15,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:01:15,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467547171] [2022-11-23 14:01:15,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:15,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:01:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:15,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:01:15,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467547171] [2022-11-23 14:01:15,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467547171] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:15,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174659715] [2022-11-23 14:01:15,767 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:01:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:01:15,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:01:15,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-23 14:01:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:16,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-23 14:01:16,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:01:16,063 INFO L321 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-11-23 14:01:16,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 27 [2022-11-23 14:01:16,176 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-23 14:01:16,176 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-23 14:01:16,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-11-23 14:01:16,523 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-11-23 14:01:16,546 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-11-23 14:01:16,693 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-11-23 14:01:16,753 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:01:16,753 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 29 [2022-11-23 14:01:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:16,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:01:17,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:01:18,270 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 1487 treesize of output 1469 [2022-11-23 14:01:18,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:18,288 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 1413 treesize of output 1395 [2022-11-23 14:01:18,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:18,304 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 1334 treesize of output 1318 [2022-11-23 14:01:18,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:18,320 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 1206 treesize of output 1174 [2022-11-23 14:01:18,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:18,336 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 950 treesize of output 886 [2022-11-23 14:01:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:18,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174659715] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:18,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:01:18,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 13] total 40 [2022-11-23 14:01:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166381908] [2022-11-23 14:01:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:01:18,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-23 14:01:18,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:01:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-23 14:01:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1438, Unknown=60, NotChecked=78, Total=1722 [2022-11-23 14:01:18,524 INFO L87 Difference]: Start difference. First operand 17291 states and 52429 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:21,381 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 14:01:21,465 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3146 (Array Int Int)) (v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#writer~0#1.base| v_ArrVal_3146) |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#r~3#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#writer~0#1.base|) 0))) is different from false [2022-11-23 14:01:21,582 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:21,796 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:22,323 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:24,380 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-11-23 14:01:25,240 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_#in~arg#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:25,836 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_~r~1#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:30,748 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((v_ArrVal_3148 (Array Int Int)) (v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3148) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:30,974 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) is different from false [2022-11-23 14:01:33,024 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-11-23 14:01:35,053 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-11-23 14:01:37,267 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3151 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))))) (forall ((v_ArrVal_3149 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int) (v_ArrVal_3151 Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3149) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3151) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-23 14:01:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:01:39,800 INFO L93 Difference]: Finished difference Result 31136 states and 93825 transitions. [2022-11-23 14:01:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-23 14:01:39,800 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:01:39,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:01:39,881 INFO L225 Difference]: With dead ends: 31136 [2022-11-23 14:01:39,881 INFO L226 Difference]: Without dead ends: 31136 [2022-11-23 14:01:39,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=226, Invalid=2117, Unknown=151, NotChecked=1166, Total=3660 [2022-11-23 14:01:39,882 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 410 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 46 mSolverCounterUnsat, 594 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 594 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:01:39,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 76 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2265 Invalid, 594 Unknown, 449 Unchecked, 12.8s Time] [2022-11-23 14:01:39,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31136 states. [2022-11-23 14:01:40,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31136 to 19259. [2022-11-23 14:01:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19259 states, 19255 states have (on average 3.0167748636717735) internal successors, (58088), 19258 states have internal predecessors, (58088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:40,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19259 states to 19259 states and 58088 transitions. [2022-11-23 14:01:40,379 INFO L78 Accepts]: Start accepts. Automaton has 19259 states and 58088 transitions. Word has length 32 [2022-11-23 14:01:40,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:01:40,380 INFO L495 AbstractCegarLoop]: Abstraction has 19259 states and 58088 transitions. [2022-11-23 14:01:40,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand 19259 states and 58088 transitions. [2022-11-23 14:01:40,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:01:40,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:01:40,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:01:40,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-23 14:01:40,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:40,616 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:01:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:01:40,616 INFO L85 PathProgramCache]: Analyzing trace with hash 2071494510, now seen corresponding path program 5 times [2022-11-23 14:01:40,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:01:40,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669454078] [2022-11-23 14:01:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:01:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:41,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:41,224 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:01:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669454078] [2022-11-23 14:01:41,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669454078] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:41,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870259374] [2022-11-23 14:01:41,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:01:41,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:41,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:01:41,225 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:01:41,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-23 14:01:41,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:01:41,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:01:41,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 90 conjunts are in the unsatisfiable core [2022-11-23 14:01:41,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:01:41,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:41,548 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-11-23 14:01:41,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:41,553 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-11-23 14:01:41,557 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-11-23 14:01:41,735 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-11-23 14:01:42,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:42,252 INFO L321 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2022-11-23 14:01:42,252 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-11-23 14:01:42,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-23 14:01:42,363 INFO L321 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2022-11-23 14:01:42,363 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 41 [2022-11-23 14:01:42,553 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2022-11-23 14:01:42,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 20 [2022-11-23 14:01:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:42,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 14:01:42,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870259374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:01:42,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 14:01:42,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [14] total 31 [2022-11-23 14:01:42,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064296821] [2022-11-23 14:01:42,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:01:42,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-23 14:01:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:01:42,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-23 14:01:42,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2022-11-23 14:01:42,762 INFO L87 Difference]: Start difference. First operand 19259 states and 58088 transitions. Second operand has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:01:46,907 INFO L93 Difference]: Finished difference Result 24198 states and 73002 transitions. [2022-11-23 14:01:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-23 14:01:46,908 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:01:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:01:46,962 INFO L225 Difference]: With dead ends: 24198 [2022-11-23 14:01:46,962 INFO L226 Difference]: Without dead ends: 24198 [2022-11-23 14:01:46,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2022-11-23 14:01:46,962 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 513 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:01:46,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 150 Invalid, 3731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-23 14:01:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24198 states. [2022-11-23 14:01:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24198 to 18380. [2022-11-23 14:01:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18380 states, 18376 states have (on average 3.0487592511972137) internal successors, (56024), 18379 states have internal predecessors, (56024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:47,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18380 states to 18380 states and 56024 transitions. [2022-11-23 14:01:47,462 INFO L78 Accepts]: Start accepts. Automaton has 18380 states and 56024 transitions. Word has length 32 [2022-11-23 14:01:47,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:01:47,462 INFO L495 AbstractCegarLoop]: Abstraction has 18380 states and 56024 transitions. [2022-11-23 14:01:47,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 18380 states and 56024 transitions. [2022-11-23 14:01:47,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:01:47,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:01:47,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:01:47,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-23 14:01:47,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable93 [2022-11-23 14:01:47,677 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:01:47,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:01:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 706144960, now seen corresponding path program 6 times [2022-11-23 14:01:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:01:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982494280] [2022-11-23 14:01:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:01:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:01:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:01:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:48,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:01:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982494280] [2022-11-23 14:01:48,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982494280] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:48,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548757144] [2022-11-23 14:01:48,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:01:48,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:01:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:01:48,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:01:48,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-23 14:01:48,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:01:48,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:01:48,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:01:48,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:01:48,398 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:01:48,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 14:01:48,438 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:01:48,438 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 11 treesize of output 11 [2022-11-23 14:01:48,574 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-11-23 14:01:48,598 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-11-23 14:01:48,707 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-11-23 14:01:48,764 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:01:48,764 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 29 [2022-11-23 14:01:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:48,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:01:49,104 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:01:49,114 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:01:49,129 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3294) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:01:49,257 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 93 treesize of output 89 [2022-11-23 14:01:49,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:49,262 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 68 treesize of output 64 [2022-11-23 14:01:49,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:49,267 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 57 treesize of output 55 [2022-11-23 14:01:49,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:01:49,272 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 55 treesize of output 51 [2022-11-23 14:01:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:01:49,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548757144] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:01:49,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:01:49,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 32 [2022-11-23 14:01:49,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407693126] [2022-11-23 14:01:49,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:01:49,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:01:49,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:01:49,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:01:49,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=811, Unknown=11, NotChecked=180, Total=1122 [2022-11-23 14:01:49,464 INFO L87 Difference]: Start difference. First operand 18380 states and 56024 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:01:54,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 [1] [2022-11-23 14:01:54,950 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3294 (Array Int Int)) (v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3294) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-23 14:01:55,195 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-23 14:01:57,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:01:58,861 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3295 (Array Int Int)) (v_ArrVal_3297 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3295) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3297 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3297) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 14:02:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:02:00,357 INFO L93 Difference]: Finished difference Result 31074 states and 93934 transitions. [2022-11-23 14:02:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-23 14:02:00,358 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:02:00,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:02:00,435 INFO L225 Difference]: With dead ends: 31074 [2022-11-23 14:02:00,435 INFO L226 Difference]: Without dead ends: 31074 [2022-11-23 14:02:00,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=269, Invalid=1715, Unknown=20, NotChecked=546, Total=2550 [2022-11-23 14:02:00,436 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 428 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 17 mSolverCounterUnsat, 94 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 94 IncrementalHoareTripleChecker+Unknown, 523 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-23 14:02:00,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 134 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1595 Invalid, 94 Unknown, 523 Unchecked, 7.8s Time] [2022-11-23 14:02:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31074 states. [2022-11-23 14:02:01,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31074 to 19376. [2022-11-23 14:02:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19376 states, 19372 states have (on average 3.042690481106752) internal successors, (58943), 19375 states have internal predecessors, (58943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19376 states to 19376 states and 58943 transitions. [2022-11-23 14:02:01,075 INFO L78 Accepts]: Start accepts. Automaton has 19376 states and 58943 transitions. Word has length 32 [2022-11-23 14:02:01,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:02:01,075 INFO L495 AbstractCegarLoop]: Abstraction has 19376 states and 58943 transitions. [2022-11-23 14:02:01,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:01,075 INFO L276 IsEmpty]: Start isEmpty. Operand 19376 states and 58943 transitions. [2022-11-23 14:02:01,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:02:01,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:02:01,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:02:01,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-23 14:02:01,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:01,298 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:02:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:02:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -731706250, now seen corresponding path program 7 times [2022-11-23 14:02:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:02:01,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801284708] [2022-11-23 14:02:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:02:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:02:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:01,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:02:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801284708] [2022-11-23 14:02:01,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801284708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:01,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605711723] [2022-11-23 14:02:01,813 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:02:01,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:01,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:02:01,814 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:02:01,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-23 14:02:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:02,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:02:02,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:02:02,135 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:02:02,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 14:02:02,175 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:02:02,175 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 11 treesize of output 11 [2022-11-23 14:02:02,311 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-11-23 14:02:02,335 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-11-23 14:02:02,452 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-11-23 14:02:02,502 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:02:02,502 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 29 [2022-11-23 14:02:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:02,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:02:02,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3366 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3366) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 14:02:02,771 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3366 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3366) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 14:02:02,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3365 (Array Int Int)) (v_ArrVal_3366 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3365) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3366) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 14:02:05,010 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 93 treesize of output 89 [2022-11-23 14:02:05,013 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:05,015 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 68 treesize of output 64 [2022-11-23 14:02:05,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:05,020 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 64 treesize of output 60 [2022-11-23 14:02:05,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:05,024 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 48 treesize of output 46 [2022-11-23 14:02:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:05,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605711723] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:05,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:02:05,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 33 [2022-11-23 14:02:05,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963284560] [2022-11-23 14:02:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:02:05,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:02:05,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:02:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:02:05,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=896, Unknown=10, NotChecked=186, Total=1190 [2022-11-23 14:02:05,245 INFO L87 Difference]: Start difference. First operand 19376 states and 58943 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:23,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:02:25,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:02:27,331 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-11-23 14:02:29,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:02:31,975 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-11-23 14:02:34,022 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-11-23 14:02:37,415 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-11-23 14:02:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:02:39,039 INFO L93 Difference]: Finished difference Result 28215 states and 84528 transitions. [2022-11-23 14:02:39,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-23 14:02:39,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:02:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:02:39,106 INFO L225 Difference]: With dead ends: 28215 [2022-11-23 14:02:39,106 INFO L226 Difference]: Without dead ends: 28215 [2022-11-23 14:02:39,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=313, Invalid=2172, Unknown=77, NotChecked=300, Total=2862 [2022-11-23 14:02:39,106 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 492 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 17 mSolverCounterUnsat, 102 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 102 IncrementalHoareTripleChecker+Unknown, 812 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-11-23 14:02:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 105 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1128 Invalid, 102 Unknown, 812 Unchecked, 16.9s Time] [2022-11-23 14:02:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2022-11-23 14:02:39,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 20048. [2022-11-23 14:02:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20048 states, 20044 states have (on average 3.039912193175015) internal successors, (60932), 20047 states have internal predecessors, (60932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20048 states to 20048 states and 60932 transitions. [2022-11-23 14:02:39,538 INFO L78 Accepts]: Start accepts. Automaton has 20048 states and 60932 transitions. Word has length 32 [2022-11-23 14:02:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:02:39,539 INFO L495 AbstractCegarLoop]: Abstraction has 20048 states and 60932 transitions. [2022-11-23 14:02:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:39,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20048 states and 60932 transitions. [2022-11-23 14:02:39,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:02:39,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:02:39,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:02:39,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-23 14:02:39,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:39,761 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:02:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:02:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1944504016, now seen corresponding path program 8 times [2022-11-23 14:02:39,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:02:39,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831918706] [2022-11-23 14:02:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:02:39,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:02:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:40,167 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:02:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831918706] [2022-11-23 14:02:40,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831918706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:40,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537946481] [2022-11-23 14:02:40,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 14:02:40,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:40,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:02:40,169 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:02:40,170 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-23 14:02:40,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-23 14:02:40,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:02:40,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-23 14:02:40,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:02:40,517 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:02:40,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 14:02:40,556 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:02:40,556 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 11 treesize of output 11 [2022-11-23 14:02:40,673 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-11-23 14:02:40,693 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-11-23 14:02:40,807 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-11-23 14:02:40,858 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:02:40,858 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 29 [2022-11-23 14:02:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:40,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:02:41,083 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 14:02:41,284 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3436 Int) (v_ArrVal_3434 (Array Int Int)) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3434) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:02:41,379 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 93 treesize of output 89 [2022-11-23 14:02:41,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:41,384 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 68 treesize of output 64 [2022-11-23 14:02:41,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:41,389 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 57 treesize of output 55 [2022-11-23 14:02:41,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:41,394 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 55 treesize of output 51 [2022-11-23 14:02:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537946481] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:02:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 32 [2022-11-23 14:02:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560994213] [2022-11-23 14:02:41,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:02:41,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:02:41,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:02:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:02:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=861, Unknown=15, NotChecked=122, Total=1122 [2022-11-23 14:02:41,563 INFO L87 Difference]: Start difference. First operand 20048 states and 60932 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:41,820 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3436 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-23 14:02:42,148 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base|) 0)) (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3436 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3436 Int) (v_ArrVal_3434 (Array Int Int)) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3434) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-23 14:02:42,795 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3436 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-23 14:02:43,226 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (forall ((v_ArrVal_3436 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|)))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) (forall ((v_ArrVal_3436 Int) (v_ArrVal_3435 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3435) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3436) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2)))) is different from false [2022-11-23 14:02:43,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:02:43,953 INFO L93 Difference]: Finished difference Result 22437 states and 67834 transitions. [2022-11-23 14:02:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-23 14:02:43,954 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:02:43,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:02:44,007 INFO L225 Difference]: With dead ends: 22437 [2022-11-23 14:02:44,007 INFO L226 Difference]: Without dead ends: 22437 [2022-11-23 14:02:44,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=1278, Unknown=38, NotChecked=474, Total=1980 [2022-11-23 14:02:44,008 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 287 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 17 mSolverCounterUnsat, 85 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 85 IncrementalHoareTripleChecker+Unknown, 412 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-23 14:02:44,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 100 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1115 Invalid, 85 Unknown, 412 Unchecked, 1.6s Time] [2022-11-23 14:02:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22437 states. [2022-11-23 14:02:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22437 to 20246. [2022-11-23 14:02:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20246 states, 20242 states have (on average 3.0397687975496495) internal successors, (61531), 20245 states have internal predecessors, (61531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20246 states to 20246 states and 61531 transitions. [2022-11-23 14:02:44,432 INFO L78 Accepts]: Start accepts. Automaton has 20246 states and 61531 transitions. Word has length 32 [2022-11-23 14:02:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:02:44,432 INFO L495 AbstractCegarLoop]: Abstraction has 20246 states and 61531 transitions. [2022-11-23 14:02:44,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 20246 states and 61531 transitions. [2022-11-23 14:02:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:02:44,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:02:44,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:02:44,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-23 14:02:44,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:44,654 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:02:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:02:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash -511283354, now seen corresponding path program 9 times [2022-11-23 14:02:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:02:44,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103892701] [2022-11-23 14:02:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:02:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:02:44,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:02:45,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:45,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:02:45,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103892701] [2022-11-23 14:02:45,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103892701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:45,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356079045] [2022-11-23 14:02:45,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-23 14:02:45,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:02:45,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:02:45,192 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:02:45,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-23 14:02:45,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-23 14:02:45,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 14:02:45,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:02:45,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:02:45,509 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:02:45,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 14:02:45,544 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:02:45,544 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 11 treesize of output 11 [2022-11-23 14:02:45,744 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-11-23 14:02:45,767 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-11-23 14:02:45,894 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-11-23 14:02:45,956 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:02:45,957 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 29 [2022-11-23 14:02:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:46,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:02:46,349 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3507 Int) (v_ArrVal_3505 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3505) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3507) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:02:46,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3507 Int) (v_ArrVal_3505 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3505) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3507) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:02:50,747 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 187 treesize of output 181 [2022-11-23 14:02:50,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:50,753 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 146 treesize of output 138 [2022-11-23 14:02:50,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:50,759 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 131 treesize of output 125 [2022-11-23 14:02:50,762 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:02:50,764 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 106 treesize of output 102 [2022-11-23 14:02:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:02:50,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356079045] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:02:50,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:02:50,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14, 12] total 34 [2022-11-23 14:02:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361630469] [2022-11-23 14:02:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:02:50,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:02:50,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:02:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:02:50,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=994, Unknown=31, NotChecked=130, Total=1260 [2022-11-23 14:02:50,937 INFO L87 Difference]: Start difference. First operand 20246 states and 61531 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:02:54,475 WARN L837 $PredicateComparison]: unable to prove that (and (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_writer_fnThread1of1ForFork0_~r~1#1.base|) 0)) (forall ((v_ArrVal_3507 Int) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3504) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3505) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3507) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (not (= (select |c_#valid| |c_reader_twoThread1of1ForFork1_#in~arg#1.base|) 0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#r~3#1.base|) 0))) is different from false [2022-11-23 14:02:54,823 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3507 Int) (v_ArrVal_3504 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3504) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3505) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3507) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) (forall ((|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (forall ((v_ArrVal_3507 Int)) (not (< 0 (select (store (select |c_#memory_int| |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3507) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))))) is different from false [2022-11-23 14:02:57,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:03:02,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-23 14:03:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:03:03,056 INFO L93 Difference]: Finished difference Result 30083 states and 91040 transitions. [2022-11-23 14:03:03,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 14:03:03,057 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2022-11-23 14:03:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:03:03,142 INFO L225 Difference]: With dead ends: 30083 [2022-11-23 14:03:03,142 INFO L226 Difference]: Without dead ends: 30083 [2022-11-23 14:03:03,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=216, Invalid=1808, Unknown=62, NotChecked=364, Total=2450 [2022-11-23 14:03:03,143 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 430 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 1806 mSolverCounterSat, 21 mSolverCounterUnsat, 339 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1806 IncrementalHoareTripleChecker+Invalid, 339 IncrementalHoareTripleChecker+Unknown, 526 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-11-23 14:03:03,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 114 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1806 Invalid, 339 Unknown, 526 Unchecked, 9.5s Time] [2022-11-23 14:03:03,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30083 states. [2022-11-23 14:03:03,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30083 to 21212. [2022-11-23 14:03:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21212 states, 21208 states have (on average 3.0391833270463975) internal successors, (64455), 21211 states have internal predecessors, (64455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:03:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21212 states to 21212 states and 64455 transitions. [2022-11-23 14:03:03,681 INFO L78 Accepts]: Start accepts. Automaton has 21212 states and 64455 transitions. Word has length 32 [2022-11-23 14:03:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:03:03,681 INFO L495 AbstractCegarLoop]: Abstraction has 21212 states and 64455 transitions. [2022-11-23 14:03:03,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:03:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21212 states and 64455 transitions. [2022-11-23 14:03:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-23 14:03:03,702 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:03:03,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:03:03,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-23 14:03:03,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:03,902 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 7 more)] === [2022-11-23 14:03:03,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:03:03,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1949134564, now seen corresponding path program 10 times [2022-11-23 14:03:03,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:03:03,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021103003] [2022-11-23 14:03:03,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:03:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:03:03,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:03:04,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:03:04,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021103003] [2022-11-23 14:03:04,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021103003] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:04,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939654182] [2022-11-23 14:03:04,395 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-23 14:03:04,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 14:03:04,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:03:04,399 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 14:03:04,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a92a4c30-4275-4316-b654-4ea0b0c1a393/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-23 14:03:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:03:04,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-23 14:03:04,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 14:03:04,723 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-23 14:03:04,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-23 14:03:04,826 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-23 14:03:04,826 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 11 treesize of output 11 [2022-11-23 14:03:04,993 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-11-23 14:03:05,017 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-11-23 14:03:05,142 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-11-23 14:03:05,196 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-23 14:03:05,196 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 29 [2022-11-23 14:03:05,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:03:05,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 14:03:05,443 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3576 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_~r#1.base| v_ArrVal_3575) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3576) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:03:05,467 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3576 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_ring_dequeue_#in~r#1.base| v_ArrVal_3575) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3576) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))) (< |reader_twoThread1of1ForFork1_~val~1#1| 2))) is different from false [2022-11-23 14:03:05,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3576 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store |c_#memory_int| |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3575) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3576) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:03:05,497 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3574 (Array Int Int)) (v_ArrVal_3575 (Array Int Int)) (v_ArrVal_3576 Int) (|reader_twoThread1of1ForFork1_~val~1#1| Int)) (or (< |reader_twoThread1of1ForFork1_~val~1#1| 2) (not (< 0 (select (store (select (store (store |c_#memory_int| |c_writer_fnThread1of1ForFork0_ring_enqueue_~r#1.base| v_ArrVal_3574) |c_reader_twoThread1of1ForFork1_~r~2#1.base| v_ArrVal_3575) |c_reader_twoThread1of1ForFork1_~#read~0#1.base|) (+ |c_reader_twoThread1of1ForFork1_~#read~0#1.offset| (* |reader_twoThread1of1ForFork1_~val~1#1| 4) (- 4)) v_ArrVal_3576) |c_reader_twoThread1of1ForFork1_~#read~0#1.offset|))))) is different from false [2022-11-23 14:03:05,717 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 93 treesize of output 89 [2022-11-23 14:03:05,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:03:05,722 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 75 treesize of output 73 [2022-11-23 14:03:05,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:03:05,727 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 59 treesize of output 55 [2022-11-23 14:03:05,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-23 14:03:05,732 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 55 treesize of output 51 [2022-11-23 14:03:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 14:03:05,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939654182] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-23 14:03:05,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-23 14:03:05,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13, 12] total 36 [2022-11-23 14:03:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921010038] [2022-11-23 14:03:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:03:05,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-23 14:03:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:03:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-23 14:03:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=981, Unknown=13, NotChecked=268, Total=1406 [2022-11-23 14:03:05,877 INFO L87 Difference]: Start difference. First operand 21212 states and 64455 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)