./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:00:00,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:00:00,073 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:00:00,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:00:00,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:00:00,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:00:00,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:00:00,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:00:00,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:00:00,147 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:00:00,148 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:00:00,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:00:00,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:00:00,155 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:00:00,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:00:00,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:00:00,160 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:00:00,161 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:00:00,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:00:00,170 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:00:00,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:00:00,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:00:00,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:00:00,179 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:00:00,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:00:00,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:00:00,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:00:00,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:00:00,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:00:00,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:00:00,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:00:00,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:00:00,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:00:00,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:00:00,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:00:00,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:00:00,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:00:00,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:00:00,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:00:00,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:00:00,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:00:00,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:00:00,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:00:00,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:00:00,253 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:00:00,253 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:00:00,254 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:00:00,254 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:00:00,255 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:00:00,255 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:00:00,255 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:00:00,255 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:00:00,257 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:00:00,257 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:00:00,257 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:00:00,258 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:00:00,258 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:00:00,258 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:00:00,258 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:00:00,259 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:00:00,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:00:00,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:00:00,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:00:00,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:00:00,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:00:00,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:00:00,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:00:00,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:00:00,261 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:00:00,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:00:00,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:00:00,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:00:00,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:00:00,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:00:00,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:00:00,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:00:00,264 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:00:00,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:00:00,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:00:00,265 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:00:00,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:00:00,265 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:00:00,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:00:00,266 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_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-11-03 02:00:00,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:00:00,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:00:00,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:00:00,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:00:00,636 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:00:00,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:00:00,739 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/aef3ea71f/e45cf0e236b2427390b10e1c15b00370/FLAGfd833fd1f [2022-11-03 02:00:01,357 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:00:01,357 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:00:01,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/aef3ea71f/e45cf0e236b2427390b10e1c15b00370/FLAGfd833fd1f [2022-11-03 02:00:01,629 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/aef3ea71f/e45cf0e236b2427390b10e1c15b00370 [2022-11-03 02:00:01,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:00:01,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:00:01,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:00:01,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:00:01,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:00:01,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:00:01" (1/1) ... [2022-11-03 02:00:01,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e3583bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:01, skipping insertion in model container [2022-11-03 02:00:01,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:00:01" (1/1) ... [2022-11-03 02:00:01,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:00:01,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:00:01,985 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:00:02,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:00:02,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:00:02,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:00:02,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:00:02,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:00:02,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:00:02,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:00:02,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:00:02,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:00:02,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:00:02,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:00:02,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:00:02,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:00:02,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:00:02,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:00:02,332 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:00:02,353 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:00:02,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:00:02,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:00:02,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:00:02,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:00:02,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:00:02,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:00:02,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:00:02,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:00:02,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:00:02,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:00:02,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:00:02,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:00:02,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:00:02,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:00:02,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:00:02,479 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:00:02,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02 WrapperNode [2022-11-03 02:00:02,479 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:00:02,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:00:02,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:00:02,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:00:02,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,538 INFO L138 Inliner]: procedures = 174, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 469 [2022-11-03 02:00:02,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:00:02,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:00:02,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:00:02,540 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:00:02,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,582 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:00:02,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:00:02,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:00:02,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:00:02,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (1/1) ... [2022-11-03 02:00:02,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:00:02,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:00:02,652 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:00:02,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:00:02,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:00:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:00:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:00:02,709 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-03 02:00:02,710 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-03 02:00:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:00:02,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:00:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:00:02,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:00:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:00:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:00:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:00:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:00:02,715 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:00:02,905 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:00:02,907 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:00:03,817 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:00:03,838 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:00:03,839 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-03 02:00:03,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:00:03 BoogieIcfgContainer [2022-11-03 02:00:03,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:00:03,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:00:03,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:00:03,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:00:03,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:00:01" (1/3) ... [2022-11-03 02:00:03,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18e66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:00:03, skipping insertion in model container [2022-11-03 02:00:03,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:00:02" (2/3) ... [2022-11-03 02:00:03,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b18e66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:00:03, skipping insertion in model container [2022-11-03 02:00:03,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:00:03" (3/3) ... [2022-11-03 02:00:03,856 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-11-03 02:00:03,867 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:00:03,880 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:00:03,880 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-03 02:00:03,880 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:00:04,054 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 02:00:04,121 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:00:04,137 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 482 places, 542 transitions, 1092 flow [2022-11-03 02:00:04,140 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 482 places, 542 transitions, 1092 flow [2022-11-03 02:00:04,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 482 places, 542 transitions, 1092 flow [2022-11-03 02:00:04,584 INFO L130 PetriNetUnfolder]: 95/795 cut-off events. [2022-11-03 02:00:04,585 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 02:00:04,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 795 events. 95/795 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2662 event pairs, 0 based on Foata normal form. 0/655 useless extension candidates. Maximal degree in co-relation 462. Up to 4 conditions per place. [2022-11-03 02:00:04,666 INFO L118 LiptonReduction]: Number of co-enabled transitions 105672 [2022-11-03 02:01:04,964 INFO L133 LiptonReduction]: Checked pairs total: 231267 [2022-11-03 02:01:04,964 INFO L135 LiptonReduction]: Total number of compositions: 574 [2022-11-03 02:01:04,975 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 160 transitions, 328 flow [2022-11-03 02:01:05,178 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3896 states, 3659 states have (on average 2.5900519267559443) internal successors, (9477), 3895 states have internal predecessors, (9477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:05,199 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:01:05,206 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;@2fef5671, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:01:05,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-03 02:01:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 3896 states, 3659 states have (on average 2.5900519267559443) internal successors, (9477), 3895 states have internal predecessors, (9477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:05,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:01:05,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:05,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:01:05,227 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:05,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 69215, now seen corresponding path program 1 times [2022-11-03 02:01:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:05,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900266750] [2022-11-03 02:01:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:05,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-03 02:01:05,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:05,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900266750] [2022-11-03 02:01:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900266750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:05,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:05,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:01:05,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515635656] [2022-11-03 02:01:05,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:05,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:01:05,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:05,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:01:05,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:01:05,593 INFO L87 Difference]: Start difference. First operand has 3896 states, 3659 states have (on average 2.5900519267559443) internal successors, (9477), 3895 states have internal predecessors, (9477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:06,025 INFO L93 Difference]: Finished difference Result 3894 states and 8659 transitions. [2022-11-03 02:01:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:01:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 02:01:06,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:06,071 INFO L225 Difference]: With dead ends: 3894 [2022-11-03 02:01:06,071 INFO L226 Difference]: Without dead ends: 3892 [2022-11-03 02:01:06,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:01:06,077 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:06,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:01:06,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2022-11-03 02:01:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3892. [2022-11-03 02:01:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3659 states have (on average 2.3656736813336976) internal successors, (8656), 3891 states have internal predecessors, (8656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 8656 transitions. [2022-11-03 02:01:06,370 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 8656 transitions. Word has length 2 [2022-11-03 02:01:06,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:06,370 INFO L495 AbstractCegarLoop]: Abstraction has 3892 states and 8656 transitions. [2022-11-03 02:01:06,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 8656 transitions. [2022-11-03 02:01:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:01:06,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:06,372 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:01:06,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:01:06,373 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash 2064101963, now seen corresponding path program 1 times [2022-11-03 02:01:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:06,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892025300] [2022-11-03 02:01:06,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:06,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:06,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-03 02:01:06,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:06,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892025300] [2022-11-03 02:01:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892025300] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:06,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:06,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:01:06,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609935679] [2022-11-03 02:01:06,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:06,595 INFO L87 Difference]: Start difference. First operand 3892 states and 8656 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:07,056 INFO L93 Difference]: Finished difference Result 3893 states and 8657 transitions. [2022-11-03 02:01:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:07,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:01:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:07,084 INFO L225 Difference]: With dead ends: 3893 [2022-11-03 02:01:07,085 INFO L226 Difference]: Without dead ends: 3893 [2022-11-03 02:01:07,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:01:07,093 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:07,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:01:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3893 states. [2022-11-03 02:01:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3893 to 3893. [2022-11-03 02:01:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3893 states, 3660 states have (on average 2.3653005464480876) internal successors, (8657), 3892 states have internal predecessors, (8657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3893 states to 3893 states and 8657 transitions. [2022-11-03 02:01:07,317 INFO L78 Accepts]: Start accepts. Automaton has 3893 states and 8657 transitions. Word has length 5 [2022-11-03 02:01:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:07,317 INFO L495 AbstractCegarLoop]: Abstraction has 3893 states and 8657 transitions. [2022-11-03 02:01:07,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3893 states and 8657 transitions. [2022-11-03 02:01:07,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:01:07,319 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:07,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:01:07,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:01:07,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:07,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:07,322 INFO L85 PathProgramCache]: Analyzing trace with hash -526058922, now seen corresponding path program 1 times [2022-11-03 02:01:07,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:07,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732994404] [2022-11-03 02:01:07,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:07,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:07,532 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-03 02:01:07,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:07,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732994404] [2022-11-03 02:01:07,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732994404] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940155115] [2022-11-03 02:01:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:07,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:07,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:07,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:07,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:01:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:07,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:01:07,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:07,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:01:07,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940155115] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:07,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:01:07,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-03 02:01:07,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129033708] [2022-11-03 02:01:07,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:07,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:01:07,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:07,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:01:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:01:07,755 INFO L87 Difference]: Start difference. First operand 3893 states and 8657 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:08,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:08,228 INFO L93 Difference]: Finished difference Result 3838 states and 8593 transitions. [2022-11-03 02:01:08,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:01:08,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:01:08,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:08,250 INFO L225 Difference]: With dead ends: 3838 [2022-11-03 02:01:08,250 INFO L226 Difference]: Without dead ends: 3838 [2022-11-03 02:01:08,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:01:08,252 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:08,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 25 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:01:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2022-11-03 02:01:08,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3838. [2022-11-03 02:01:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3838 states, 3617 states have (on average 2.375725739563174) internal successors, (8593), 3837 states have internal predecessors, (8593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3838 states to 3838 states and 8593 transitions. [2022-11-03 02:01:08,422 INFO L78 Accepts]: Start accepts. Automaton has 3838 states and 8593 transitions. Word has length 6 [2022-11-03 02:01:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:08,423 INFO L495 AbstractCegarLoop]: Abstraction has 3838 states and 8593 transitions. [2022-11-03 02:01:08,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3838 states and 8593 transitions. [2022-11-03 02:01:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:01:08,424 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:08,424 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:08,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:08,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:08,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:08,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1194961670, now seen corresponding path program 1 times [2022-11-03 02:01:08,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:08,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500588839] [2022-11-03 02:01:08,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:08,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:01:08,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500588839] [2022-11-03 02:01:08,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500588839] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:08,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437016299] [2022-11-03 02:01:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:08,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:08,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:08,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:08,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:01:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:08,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:01:08,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:01:08,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:08,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:01:08,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437016299] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:08,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1596766373] [2022-11-03 02:01:09,006 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-03 02:01:09,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:09,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2022-11-03 02:01:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956779703] [2022-11-03 02:01:09,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:09,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:01:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:01:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:01:09,021 INFO L87 Difference]: Start difference. First operand 3838 states and 8593 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:09,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:09,450 INFO L93 Difference]: Finished difference Result 3839 states and 8594 transitions. [2022-11-03 02:01:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:01:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:01:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:09,473 INFO L225 Difference]: With dead ends: 3839 [2022-11-03 02:01:09,473 INFO L226 Difference]: Without dead ends: 3839 [2022-11-03 02:01:09,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:01:09,475 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:09,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:01:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3839 states. [2022-11-03 02:01:09,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3839 to 3839. [2022-11-03 02:01:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3618 states have (on average 2.37534549474848) internal successors, (8594), 3838 states have internal predecessors, (8594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 8594 transitions. [2022-11-03 02:01:09,635 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 8594 transitions. Word has length 8 [2022-11-03 02:01:09,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:09,635 INFO L495 AbstractCegarLoop]: Abstraction has 3839 states and 8594 transitions. [2022-11-03 02:01:09,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:09,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 8594 transitions. [2022-11-03 02:01:09,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:01:09,636 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:09,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 02:01:09,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:09,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:09,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1094476571, now seen corresponding path program 2 times [2022-11-03 02:01:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:09,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863268993] [2022-11-03 02:01:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:09,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863268993] [2022-11-03 02:01:09,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863268993] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:09,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537863485] [2022-11-03 02:01:09,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:01:09,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:09,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:09,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:01:10,278 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:01:10,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:01:10,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:01:10,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:10,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:01:10,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537863485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:10,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:01:10,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 02:01:10,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258932413] [2022-11-03 02:01:10,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:01:10,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:01:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:01:10,301 INFO L87 Difference]: Start difference. First operand 3839 states and 8594 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:10,749 INFO L93 Difference]: Finished difference Result 3723 states and 8348 transitions. [2022-11-03 02:01:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:01:10,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:01:10,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:10,770 INFO L225 Difference]: With dead ends: 3723 [2022-11-03 02:01:10,771 INFO L226 Difference]: Without dead ends: 3723 [2022-11-03 02:01:10,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:01:10,772 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 276 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:10,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 24 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:01:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-11-03 02:01:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3723. [2022-11-03 02:01:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3723 states, 3515 states have (on average 2.374964438122333) internal successors, (8348), 3722 states have internal predecessors, (8348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3723 states to 3723 states and 8348 transitions. [2022-11-03 02:01:10,878 INFO L78 Accepts]: Start accepts. Automaton has 3723 states and 8348 transitions. Word has length 9 [2022-11-03 02:01:10,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:10,879 INFO L495 AbstractCegarLoop]: Abstraction has 3723 states and 8348 transitions. [2022-11-03 02:01:10,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 8348 transitions. [2022-11-03 02:01:10,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:01:10,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:10,880 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:10,925 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:11,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:11,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:11,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1094413349, now seen corresponding path program 1 times [2022-11-03 02:01:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:11,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709492870] [2022-11-03 02:01:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:12,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:12,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709492870] [2022-11-03 02:01:12,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709492870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:12,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:12,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:01:12,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916208423] [2022-11-03 02:01:12,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:12,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:01:12,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:12,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:01:12,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:01:12,322 INFO L87 Difference]: Start difference. First operand 3723 states and 8348 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:13,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:13,165 INFO L93 Difference]: Finished difference Result 3775 states and 8456 transitions. [2022-11-03 02:01:13,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:01:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:01:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:13,185 INFO L225 Difference]: With dead ends: 3775 [2022-11-03 02:01:13,186 INFO L226 Difference]: Without dead ends: 3775 [2022-11-03 02:01:13,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:01:13,187 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 99 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:13,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 19 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:01:13,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2022-11-03 02:01:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 3736. [2022-11-03 02:01:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3528 states have (on average 2.3738662131519273) internal successors, (8375), 3735 states have internal predecessors, (8375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 8375 transitions. [2022-11-03 02:01:13,302 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 8375 transitions. Word has length 9 [2022-11-03 02:01:13,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:13,303 INFO L495 AbstractCegarLoop]: Abstraction has 3736 states and 8375 transitions. [2022-11-03 02:01:13,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 8375 transitions. [2022-11-03 02:01:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:01:13,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:13,304 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:13,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:01:13,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:13,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:13,305 INFO L85 PathProgramCache]: Analyzing trace with hash -430891219, now seen corresponding path program 1 times [2022-11-03 02:01:13,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:13,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268507148] [2022-11-03 02:01:13,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:14,357 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268507148] [2022-11-03 02:01:14,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268507148] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095401460] [2022-11-03 02:01:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:14,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:14,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:14,359 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:14,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:01:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:14,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-03 02:01:14,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:14,735 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:14,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:14,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:14,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:14,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 21 [2022-11-03 02:01:15,009 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:01:15,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:15,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:15,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:15,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:15,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:15,180 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-11-03 02:01:15,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_742 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_742) |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-11-03 02:01:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 02:01:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095401460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:15,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [569388320] [2022-11-03 02:01:15,351 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-03 02:01:15,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:15,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-03 02:01:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590460039] [2022-11-03 02:01:15,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:01:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:01:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=3, NotChecked=54, Total=272 [2022-11-03 02:01:15,354 INFO L87 Difference]: Start difference. First operand 3736 states and 8375 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:17,361 INFO L93 Difference]: Finished difference Result 3868 states and 8654 transitions. [2022-11-03 02:01:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:01:17,362 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:01:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:17,379 INFO L225 Difference]: With dead ends: 3868 [2022-11-03 02:01:17,380 INFO L226 Difference]: Without dead ends: 3868 [2022-11-03 02:01:17,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=214, Unknown=3, NotChecked=66, Total=380 [2022-11-03 02:01:17,381 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 190 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 774 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:17,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 61 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1491 Invalid, 0 Unknown, 774 Unchecked, 1.7s Time] [2022-11-03 02:01:17,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2022-11-03 02:01:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3750. [2022-11-03 02:01:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3750 states, 3542 states have (on average 2.372670807453416) internal successors, (8404), 3749 states have internal predecessors, (8404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3750 states to 3750 states and 8404 transitions. [2022-11-03 02:01:17,493 INFO L78 Accepts]: Start accepts. Automaton has 3750 states and 8404 transitions. Word has length 10 [2022-11-03 02:01:17,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:17,493 INFO L495 AbstractCegarLoop]: Abstraction has 3750 states and 8404 transitions. [2022-11-03 02:01:17,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3750 states and 8404 transitions. [2022-11-03 02:01:17,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:17,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:17,494 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:17,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:17,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-03 02:01:17,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash -472723769, now seen corresponding path program 1 times [2022-11-03 02:01:17,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:17,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68828151] [2022-11-03 02:01:17,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:17,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:18,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68828151] [2022-11-03 02:01:18,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68828151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:18,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151853969] [2022-11-03 02:01:18,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:18,809 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:18,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:18,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:01:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:19,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:01:19,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:19,221 INFO L356 Elim1Store]: treesize reduction 190, result has 19.1 percent of original size [2022-11-03 02:01:19,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 50 treesize of output 77 [2022-11-03 02:01:19,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:01:19,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:01:19,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2022-11-03 02:01:19,770 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:01:19,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 02:01:19,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:01:19,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:19,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:19,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 26 [2022-11-03 02:01:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:20,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:20,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151853969] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:20,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [601974341] [2022-11-03 02:01:20,396 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-03 02:01:20,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:20,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2022-11-03 02:01:20,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584417228] [2022-11-03 02:01:20,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:20,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:01:20,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:20,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:01:20,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=256, Unknown=11, NotChecked=0, Total=342 [2022-11-03 02:01:20,400 INFO L87 Difference]: Start difference. First operand 3750 states and 8404 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-03 02:01:22,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:22,460 INFO L93 Difference]: Finished difference Result 3809 states and 8484 transitions. [2022-11-03 02:01:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:01:22,461 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 11 [2022-11-03 02:01:22,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:22,483 INFO L225 Difference]: With dead ends: 3809 [2022-11-03 02:01:22,483 INFO L226 Difference]: Without dead ends: 3809 [2022-11-03 02:01:22,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=135, Invalid=360, Unknown=11, NotChecked=0, Total=506 [2022-11-03 02:01:22,487 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 170 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:22,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 57 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1300 Invalid, 0 Unknown, 707 Unchecked, 1.6s Time] [2022-11-03 02:01:22,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2022-11-03 02:01:22,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3764. [2022-11-03 02:01:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3556 states have (on average 2.3714848143982) internal successors, (8433), 3763 states have internal predecessors, (8433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:22,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 8433 transitions. [2022-11-03 02:01:22,616 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 8433 transitions. Word has length 11 [2022-11-03 02:01:22,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:22,617 INFO L495 AbstractCegarLoop]: Abstraction has 3764 states and 8433 transitions. [2022-11-03 02:01:22,617 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-03 02:01:22,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 8433 transitions. [2022-11-03 02:01:22,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:01:22,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:22,620 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:22,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:22,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:22,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:22,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -535964759, now seen corresponding path program 1 times [2022-11-03 02:01:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:22,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047354465] [2022-11-03 02:01:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:23,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:23,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047354465] [2022-11-03 02:01:23,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047354465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:01:23,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:01:23,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:01:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551487104] [2022-11-03 02:01:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:01:23,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:01:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:23,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:01:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:01:23,863 INFO L87 Difference]: Start difference. First operand 3764 states and 8433 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:25,167 INFO L93 Difference]: Finished difference Result 3845 states and 8604 transitions. [2022-11-03 02:01:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:01:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:01:25,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:25,184 INFO L225 Difference]: With dead ends: 3845 [2022-11-03 02:01:25,185 INFO L226 Difference]: Without dead ends: 3845 [2022-11-03 02:01:25,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:01:25,187 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 162 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:25,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 33 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:01:25,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2022-11-03 02:01:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2022-11-03 02:01:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3637 states have (on average 2.3656860049491337) internal successors, (8604), 3844 states have internal predecessors, (8604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:25,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 8604 transitions. [2022-11-03 02:01:25,291 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 8604 transitions. Word has length 11 [2022-11-03 02:01:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:25,292 INFO L495 AbstractCegarLoop]: Abstraction has 3845 states and 8604 transitions. [2022-11-03 02:01:25,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 8604 transitions. [2022-11-03 02:01:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:01:25,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:25,294 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:25,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:01:25,295 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1769528680, now seen corresponding path program 1 times [2022-11-03 02:01:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:25,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99178600] [2022-11-03 02:01:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:26,144 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:26,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99178600] [2022-11-03 02:01:26,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99178600] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:26,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487081356] [2022-11-03 02:01:26,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:26,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:26,148 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:26,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:01:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:26,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-03 02:01:26,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:26,483 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:26,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:26,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:26,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:26,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:01:26,833 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:01:26,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 02:01:26,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:27,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:27,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:27,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:27,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:27,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1186) |c_~#in~0.base|))) (or (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0))))) is different from false [2022-11-03 02:01:27,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1186 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1185) |c_~#pre~0.base| v_ArrVal_1186) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:27,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 02:01:27,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487081356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:27,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [737490726] [2022-11-03 02:01:27,527 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-03 02:01:27,528 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:27,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2022-11-03 02:01:27,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369213308] [2022-11-03 02:01:27,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:27,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:01:27,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:27,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:01:27,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=279, Unknown=3, NotChecked=70, Total=420 [2022-11-03 02:01:27,531 INFO L87 Difference]: Start difference. First operand 3845 states and 8604 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:29,248 INFO L93 Difference]: Finished difference Result 4052 states and 8982 transitions. [2022-11-03 02:01:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:01:29,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:01:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:29,263 INFO L225 Difference]: With dead ends: 4052 [2022-11-03 02:01:29,263 INFO L226 Difference]: Without dead ends: 4052 [2022-11-03 02:01:29,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=380, Unknown=3, NotChecked=82, Total=552 [2022-11-03 02:01:29,264 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 132 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1273 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1113 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:29,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 67 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1273 Invalid, 0 Unknown, 1113 Unchecked, 1.5s Time] [2022-11-03 02:01:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4052 states. [2022-11-03 02:01:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4052 to 3850. [2022-11-03 02:01:29,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3642 states have (on average 2.3657331136738056) internal successors, (8616), 3849 states have internal predecessors, (8616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 8616 transitions. [2022-11-03 02:01:29,365 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 8616 transitions. Word has length 12 [2022-11-03 02:01:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:29,365 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 8616 transitions. [2022-11-03 02:01:29,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 20 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 8616 transitions. [2022-11-03 02:01:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:01:29,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:29,367 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:29,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:29,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:29,580 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 564977310, now seen corresponding path program 1 times [2022-11-03 02:01:29,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:29,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316554493] [2022-11-03 02:01:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:29,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:30,377 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:30,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316554493] [2022-11-03 02:01:30,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316554493] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:30,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999479847] [2022-11-03 02:01:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:30,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:30,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:30,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:30,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:01:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:30,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:01:30,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:30,736 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:30,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:30,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:30,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:31,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:01:31,115 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:01:31,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 02:01:31,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:31,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:31,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:31,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:31,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1367 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1367) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:31,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1367 (Array Int Int)) (v_ArrVal_1366 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1366) |c_~#pre~0.base| v_ArrVal_1367) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:31,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999479847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:31,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1468792887] [2022-11-03 02:01:31,772 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-03 02:01:31,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:31,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 21 [2022-11-03 02:01:31,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087594053] [2022-11-03 02:01:31,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:31,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:01:31,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:31,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:01:31,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=344, Unknown=3, NotChecked=78, Total=506 [2022-11-03 02:01:31,776 INFO L87 Difference]: Start difference. First operand 3850 states and 8616 transitions. Second operand has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:34,499 INFO L93 Difference]: Finished difference Result 3900 states and 8672 transitions. [2022-11-03 02:01:34,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:01:34,504 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:01:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:34,519 INFO L225 Difference]: With dead ends: 3900 [2022-11-03 02:01:34,519 INFO L226 Difference]: Without dead ends: 3900 [2022-11-03 02:01:34,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=543, Unknown=3, NotChecked=102, Total=812 [2022-11-03 02:01:34,520 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 312 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1054 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:34,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 65 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2127 Invalid, 0 Unknown, 1054 Unchecked, 2.3s Time] [2022-11-03 02:01:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2022-11-03 02:01:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 3850. [2022-11-03 02:01:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3850 states, 3645 states have (on average 2.3637860082304525) internal successors, (8616), 3849 states have internal predecessors, (8616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3850 states to 3850 states and 8616 transitions. [2022-11-03 02:01:34,679 INFO L78 Accepts]: Start accepts. Automaton has 3850 states and 8616 transitions. Word has length 12 [2022-11-03 02:01:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:34,679 INFO L495 AbstractCegarLoop]: Abstraction has 3850 states and 8616 transitions. [2022-11-03 02:01:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 22 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3850 states and 8616 transitions. [2022-11-03 02:01:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:01:34,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:34,683 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:34,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:34,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-03 02:01:34,908 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:34,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:34,908 INFO L85 PathProgramCache]: Analyzing trace with hash 979187900, now seen corresponding path program 1 times [2022-11-03 02:01:34,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:34,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513870631] [2022-11-03 02:01:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:34,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:35,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:35,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513870631] [2022-11-03 02:01:35,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513870631] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:35,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837577499] [2022-11-03 02:01:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:35,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:35,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:35,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:01:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:35,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:01:35,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:36,066 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:36,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:36,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:36,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:36,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 28 [2022-11-03 02:01:36,354 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:01:36,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:36,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:36,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:36,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:36,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1547) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= 0 (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256))))) is different from false [2022-11-03 02:01:36,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1546) |c_~#pre~0.base| v_ArrVal_1547) |c_~#post~0.base|))) (or (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0))))) is different from false [2022-11-03 02:01:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 02:01:36,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837577499] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:36,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [469235961] [2022-11-03 02:01:36,929 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-03 02:01:36,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:36,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-11-03 02:01:36,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076869222] [2022-11-03 02:01:36,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:36,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:01:36,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:36,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:01:36,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=278, Unknown=4, NotChecked=70, Total=420 [2022-11-03 02:01:36,935 INFO L87 Difference]: Start difference. First operand 3850 states and 8616 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:39,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:39,259 INFO L93 Difference]: Finished difference Result 3884 states and 8667 transitions. [2022-11-03 02:01:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:01:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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-03 02:01:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:39,276 INFO L225 Difference]: With dead ends: 3884 [2022-11-03 02:01:39,276 INFO L226 Difference]: Without dead ends: 3884 [2022-11-03 02:01:39,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=385, Unknown=4, NotChecked=86, Total=600 [2022-11-03 02:01:39,278 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 258 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 830 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:39,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 76 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2157 Invalid, 0 Unknown, 830 Unchecked, 1.9s Time] [2022-11-03 02:01:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2022-11-03 02:01:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3849. [2022-11-03 02:01:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3646 states have (on average 2.3664289632473943) internal successors, (8628), 3848 states have internal predecessors, (8628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:39,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 8628 transitions. [2022-11-03 02:01:39,402 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 8628 transitions. Word has length 13 [2022-11-03 02:01:39,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:39,402 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 8628 transitions. [2022-11-03 02:01:39,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:39,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 8628 transitions. [2022-11-03 02:01:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:01:39,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:39,407 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:39,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:39,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:39,624 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:39,624 INFO L85 PathProgramCache]: Analyzing trace with hash 951671386, now seen corresponding path program 1 times [2022-11-03 02:01:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:39,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665244818] [2022-11-03 02:01:39,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:40,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:40,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665244818] [2022-11-03 02:01:40,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665244818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:40,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118380917] [2022-11-03 02:01:40,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:40,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:40,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:40,404 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:40,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:01:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:40,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:01:40,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:40,719 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:40,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:40,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:40,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:40,919 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:01:40,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:40,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2022-11-03 02:01:40,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-03 02:01:41,065 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:01:41,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:01:41,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:41,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:41,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:41,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:41,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1732 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1732) |c_~#in~0.base|))) (or (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:41,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1732 (Array Int Int)) (v_ArrVal_1731 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1731) |c_~#pre~0.base| v_ArrVal_1732) |c_~#in~0.base|))) (or (= (mod (select .cse0 (+ |c_~#in~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#in~0.offset|) 256) 0))))) is different from false [2022-11-03 02:01:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-03 02:01:43,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118380917] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:43,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [147287718] [2022-11-03 02:01:43,669 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-03 02:01:43,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:43,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2022-11-03 02:01:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146657746] [2022-11-03 02:01:43,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:43,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:01:43,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:43,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:01:43,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=279, Unknown=3, NotChecked=70, Total=420 [2022-11-03 02:01:43,674 INFO L87 Difference]: Start difference. First operand 3849 states and 8628 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:47,034 INFO L93 Difference]: Finished difference Result 3959 states and 8813 transitions. [2022-11-03 02:01:47,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:01:47,035 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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-03 02:01:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:47,045 INFO L225 Difference]: With dead ends: 3959 [2022-11-03 02:01:47,045 INFO L226 Difference]: Without dead ends: 3959 [2022-11-03 02:01:47,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=115, Invalid=442, Unknown=3, NotChecked=90, Total=650 [2022-11-03 02:01:47,047 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 220 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1095 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:47,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 86 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2302 Invalid, 0 Unknown, 1095 Unchecked, 2.9s Time] [2022-11-03 02:01:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2022-11-03 02:01:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 3829. [2022-11-03 02:01:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3829 states, 3628 states have (on average 2.3624586549062845) internal successors, (8571), 3828 states have internal predecessors, (8571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 8571 transitions. [2022-11-03 02:01:47,149 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 8571 transitions. Word has length 13 [2022-11-03 02:01:47,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:47,149 INFO L495 AbstractCegarLoop]: Abstraction has 3829 states and 8571 transitions. [2022-11-03 02:01:47,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:47,150 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 8571 transitions. [2022-11-03 02:01:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:01:47,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:47,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:47,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:47,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:47,364 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:47,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:47,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1777109986, now seen corresponding path program 1 times [2022-11-03 02:01:47,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:47,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179321485] [2022-11-03 02:01:47,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:47,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:48,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:48,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:48,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179321485] [2022-11-03 02:01:48,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179321485] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:48,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857525365] [2022-11-03 02:01:48,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:48,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:48,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:48,300 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:48,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:01:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:48,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-03 02:01:48,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:48,686 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:48,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:48,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:48,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:49,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:49,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2022-11-03 02:01:49,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-03 02:01:49,110 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:01:49,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 02:01:49,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 40 [2022-11-03 02:01:49,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:49,395 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:01:49,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 44 [2022-11-03 02:01:49,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:01:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:49,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:49,826 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1917 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1917) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:49,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1917 (Array Int Int)) (v_ArrVal_1916 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1916) |c_~#pre~0.base| v_ArrVal_1917) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:52,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857525365] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:52,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [825821228] [2022-11-03 02:01:52,118 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-03 02:01:52,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:52,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 02:01:52,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064182715] [2022-11-03 02:01:52,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:52,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:01:52,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:01:52,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=427, Unknown=3, NotChecked=86, Total=600 [2022-11-03 02:01:52,120 INFO L87 Difference]: Start difference. First operand 3829 states and 8571 transitions. Second operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:01:55,499 INFO L93 Difference]: Finished difference Result 4046 states and 8969 transitions. [2022-11-03 02:01:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-03 02:01:55,499 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:01:55,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:01:55,509 INFO L225 Difference]: With dead ends: 4046 [2022-11-03 02:01:55,509 INFO L226 Difference]: Without dead ends: 4046 [2022-11-03 02:01:55,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=113, Invalid=594, Unknown=3, NotChecked=102, Total=812 [2022-11-03 02:01:55,511 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 169 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1427 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:01:55,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 97 Invalid, 4021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2577 Invalid, 0 Unknown, 1427 Unchecked, 3.0s Time] [2022-11-03 02:01:55,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4046 states. [2022-11-03 02:01:55,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4046 to 3853. [2022-11-03 02:01:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3652 states have (on average 2.3608981380065717) internal successors, (8622), 3852 states have internal predecessors, (8622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 8622 transitions. [2022-11-03 02:01:55,625 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 8622 transitions. Word has length 14 [2022-11-03 02:01:55,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:01:55,627 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 8622 transitions. [2022-11-03 02:01:55,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:01:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 8622 transitions. [2022-11-03 02:01:55,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:01:55,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:01:55,630 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:01:55,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:01:55,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:01:55,856 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:01:55,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:01:55,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1763769918, now seen corresponding path program 1 times [2022-11-03 02:01:55,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:01:55,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637383213] [2022-11-03 02:01:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:55,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:01:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 02:01:56,927 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:01:56,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637383213] [2022-11-03 02:01:56,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637383213] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:01:56,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265245442] [2022-11-03 02:01:56,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:01:56,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:01:56,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:01:56,929 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:01:56,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:01:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:01:57,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-03 02:01:57,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:01:57,381 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:01:57,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:01:57,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:57,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 23 [2022-11-03 02:01:57,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-03 02:01:57,805 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:01:57,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2022-11-03 02:01:57,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:57,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:01:57,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:01:58,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-03 02:01:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:58,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:01:58,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2098 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2098) |c_~#post~0.base|))) (or (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0) (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0))))) is different from false [2022-11-03 02:01:58,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2098 (Array Int Int)) (v_ArrVal_2097 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2097) |c_~#pre~0.base| v_ArrVal_2098) |c_~#post~0.base|))) (or (not (<= (mod (select .cse0 |c_~#post~0.offset|) 256) 0)) (= (mod (select .cse0 (+ |c_~#post~0.offset| 1)) 256) 0)))) is different from false [2022-11-03 02:01:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:01:58,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265245442] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:01:58,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [478497220] [2022-11-03 02:01:58,655 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-03 02:01:58,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:01:58,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 02:01:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752785663] [2022-11-03 02:01:58,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:01:58,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:01:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:01:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:01:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=425, Unknown=3, NotChecked=86, Total=600 [2022-11-03 02:01:58,659 INFO L87 Difference]: Start difference. First operand 3853 states and 8622 transitions. Second operand has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:02:02,549 INFO L93 Difference]: Finished difference Result 3932 states and 8750 transitions. [2022-11-03 02:02:02,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:02:02,549 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:02:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:02:02,557 INFO L225 Difference]: With dead ends: 3932 [2022-11-03 02:02:02,557 INFO L226 Difference]: Without dead ends: 3932 [2022-11-03 02:02:02,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=191, Invalid=626, Unknown=3, NotChecked=110, Total=930 [2022-11-03 02:02:02,560 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 369 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 3036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 832 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:02:02,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 73 Invalid, 3036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2157 Invalid, 0 Unknown, 832 Unchecked, 3.1s Time] [2022-11-03 02:02:02,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3932 states. [2022-11-03 02:02:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3932 to 3815. [2022-11-03 02:02:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3815 states, 3615 states have (on average 2.362932226832642) internal successors, (8542), 3814 states have internal predecessors, (8542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3815 states to 3815 states and 8542 transitions. [2022-11-03 02:02:02,666 INFO L78 Accepts]: Start accepts. Automaton has 3815 states and 8542 transitions. Word has length 15 [2022-11-03 02:02:02,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:02:02,667 INFO L495 AbstractCegarLoop]: Abstraction has 3815 states and 8542 transitions. [2022-11-03 02:02:02,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:02:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 3815 states and 8542 transitions. [2022-11-03 02:02:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:02:02,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:02:02,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:02:02,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:02:02,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:02:02,884 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:02:02,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:02:02,884 INFO L85 PathProgramCache]: Analyzing trace with hash -425082299, now seen corresponding path program 1 times [2022-11-03 02:02:02,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:02:02,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234076882] [2022-11-03 02:02:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:02,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:02:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:02:04,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:02:04,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234076882] [2022-11-03 02:02:04,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234076882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:02:04,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944635928] [2022-11-03 02:02:04,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:02:04,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:02:04,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:02:04,676 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:02:04,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:02:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:02:05,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-03 02:02:05,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:02:05,150 INFO L356 Elim1Store]: treesize reduction 129, result has 17.8 percent of original size [2022-11-03 02:02:05,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 45 treesize of output 57 [2022-11-03 02:02:05,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-11-03 02:02:05,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-11-03 02:02:05,654 INFO L356 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-03 02:02:05,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 94 [2022-11-03 02:02:05,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2022-11-03 02:02:05,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2022-11-03 02:02:05,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-11-03 02:02:05,746 INFO L356 Elim1Store]: treesize reduction 16, result has 59.0 percent of original size [2022-11-03 02:02:05,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 02:02:05,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-03 02:02:05,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-11-03 02:02:05,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 57 [2022-11-03 02:02:06,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:02:06,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 41 [2022-11-03 02:02:06,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 25 [2022-11-03 02:02:06,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2022-11-03 02:02:06,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 46 treesize of output 26 [2022-11-03 02:02:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 02:02:06,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:02:06,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2297) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2296) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) |c_ULTIMATE.start_worker_fn_~a~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2295) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) |c_ULTIMATE.start_worker_fn_~a~0#1.offset|))) (< (select .cse0 (+ .cse1 4)) (select .cse0 .cse1)))) is different from false [2022-11-03 02:02:06,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2297) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (< (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2022-11-03 02:02:06,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2292 (Array Int Int)) (v_ArrVal_2297 (Array Int Int)) (v_ArrVal_2296 (Array Int Int)) (v_ArrVal_2295 (Array Int Int)) (v_ArrVal_2294 (Array Int Int)) (v_ArrVal_2293 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2294) |c_~#pre~0.base| v_ArrVal_2297) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2292) |c_~#pre~0.base| v_ArrVal_2296) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2293) |c_~#pre~0.base| v_ArrVal_2295) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (< (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2022-11-03 02:02:06,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:06,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 129 treesize of output 122 [2022-11-03 02:02:06,703 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:06,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 6116 treesize of output 5642 [2022-11-03 02:02:06,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 5442 treesize of output 4770 [2022-11-03 02:02:06,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 4770 treesize of output 3426 [2022-11-03 02:02:06,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3426 treesize of output 3090 [2022-11-03 02:02:12,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:12,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 60 [2022-11-03 02:02:12,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:12,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 550 treesize of output 540 [2022-11-03 02:02:12,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 526 treesize of output 494 [2022-11-03 02:02:12,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 494 treesize of output 478 [2022-11-03 02:02:12,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 478 treesize of output 414 [2022-11-03 02:02:12,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 210 treesize of output 202 [2022-11-03 02:02:13,229 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:13,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 85 [2022-11-03 02:02:13,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:13,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2022-11-03 02:02:13,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:02:13,296 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:13,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1223 treesize of output 1177 [2022-11-03 02:02:13,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:02:13,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:13,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 285 [2022-11-03 02:02:13,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1163 treesize of output 1035 [2022-11-03 02:02:13,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1035 treesize of output 971 [2022-11-03 02:02:13,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 503 treesize of output 471 [2022-11-03 02:02:17,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 238 [2022-11-03 02:02:17,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 230 [2022-11-03 02:02:17,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:02:17,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:17,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 60 [2022-11-03 02:02:17,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:02:17,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:17,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 268 [2022-11-03 02:02:17,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 130 treesize of output 122 [2022-11-03 02:02:17,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 246 treesize of output 230 [2022-11-03 02:02:17,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 198 [2022-11-03 02:02:17,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:17,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 83 [2022-11-03 02:02:17,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:02:17,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:02:17,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2327 treesize of output 2233 [2022-11-03 02:02:17,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2219 treesize of output 1963 [2022-11-03 02:02:17,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1963 treesize of output 1835 [2022-11-03 02:02:17,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 951 treesize of output 887 [2022-11-03 02:03:01,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:01,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 85 [2022-11-03 02:03:01,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:01,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2022-11-03 02:03:01,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:01,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:01,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 585 [2022-11-03 02:03:01,159 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:01,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:01,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1171 treesize of output 1125 [2022-11-03 02:03:01,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 571 treesize of output 539 [2022-11-03 02:03:01,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 279 treesize of output 263 [2022-11-03 02:03:01,278 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 523 treesize of output 459 [2022-11-03 02:03:02,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1110 treesize of output 1078 [2022-11-03 02:03:02,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 950 [2022-11-03 02:03:02,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:03:02,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:02,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 83 [2022-11-03 02:03:02,205 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:02,225 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:03:02,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2327 treesize of output 2233 [2022-11-03 02:03:02,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2219 treesize of output 1963 [2022-11-03 02:03:02,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1963 treesize of output 1835 [2022-11-03 02:03:02,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 951 treesize of output 887 [2022-11-03 02:06:11,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:11,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 106 [2022-11-03 02:06:11,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:11,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:11,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 872 treesize of output 838 [2022-11-03 02:06:11,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 824 treesize of output 776 [2022-11-03 02:06:11,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 399 treesize of output 375 [2022-11-03 02:06:11,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 752 treesize of output 656 [2022-11-03 02:06:15,533 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:15,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 85 [2022-11-03 02:06:15,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:15,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2022-11-03 02:06:15,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:15,583 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:15,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 607 treesize of output 585 [2022-11-03 02:06:15,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:06:15,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:06:15,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 285 [2022-11-03 02:06:15,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 287 treesize of output 271 [2022-11-03 02:06:15,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 555 treesize of output 491 [2022-11-03 02:06:15,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 270 treesize of output 262 [2022-11-03 02:06:15,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 491 treesize of output 459 [2022-11-03 02:06:15,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 262 treesize of output 230 [2022-11-03 02:06:15,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-03 02:06:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 1 not checked. [2022-11-03 02:06:16,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944635928] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:06:16,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [714119705] [2022-11-03 02:06:16,678 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-03 02:06:16,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:06:16,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2022-11-03 02:06:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557987905] [2022-11-03 02:06:16,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:06:16,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 02:06:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:06:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 02:06:16,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=574, Unknown=5, NotChecked=150, Total=812 [2022-11-03 02:06:16,681 INFO L87 Difference]: Start difference. First operand 3815 states and 8542 transitions. Second operand has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:06:20,614 INFO L93 Difference]: Finished difference Result 3800 states and 8511 transitions. [2022-11-03 02:06:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:06:20,615 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-03 02:06:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:06:20,625 INFO L225 Difference]: With dead ends: 3800 [2022-11-03 02:06:20,625 INFO L226 Difference]: Without dead ends: 3800 [2022-11-03 02:06:20,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=168, Invalid=769, Unknown=5, NotChecked=180, Total=1122 [2022-11-03 02:06:20,627 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 320 mSDsluCounter, 1176 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1099 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:06:20,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 105 Invalid, 3125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1984 Invalid, 0 Unknown, 1099 Unchecked, 2.7s Time] [2022-11-03 02:06:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2022-11-03 02:06:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3800. [2022-11-03 02:06:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 3601 states have (on average 2.363510136073313) internal successors, (8511), 3799 states have internal predecessors, (8511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:20,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 8511 transitions. [2022-11-03 02:06:20,730 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 8511 transitions. Word has length 16 [2022-11-03 02:06:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:06:20,731 INFO L495 AbstractCegarLoop]: Abstraction has 3800 states and 8511 transitions. [2022-11-03 02:06:20,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:06:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 8511 transitions. [2022-11-03 02:06:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:06:20,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:06:20,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:06:20,781 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:06:20,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:06:20,956 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:06:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:06:20,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2131715682, now seen corresponding path program 1 times [2022-11-03 02:06:20,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:06:20,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143119013] [2022-11-03 02:06:20,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:06:20,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:06:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:06:21,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:06:21,627 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:383) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:773) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:198) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:282) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:296) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:232) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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-03 02:06:21,630 INFO L158 Benchmark]: Toolchain (without parser) took 379996.34ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 983.6MB). Free memory was 77.6MB in the beginning and 807.6MB in the end (delta: -730.0MB). Peak memory consumption was 795.6MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,630 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 96.0MB in the beginning and 96.0MB in the end (delta: 56.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:06:21,630 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.58ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 78.0MB in the end (delta: -708.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.41ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,631 INFO L158 Benchmark]: Boogie Preprocessor took 50.57ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,636 INFO L158 Benchmark]: RCFGBuilder took 1251.10ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 76.6MB in the end (delta: -5.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,637 INFO L158 Benchmark]: TraceAbstraction took 377784.94ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 983.6MB). Free memory was 76.1MB in the beginning and 807.6MB in the end (delta: -731.5MB). Peak memory consumption was 793.1MB. Max. memory is 16.1GB. [2022-11-03 02:06:21,641 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory was 96.0MB in the beginning and 96.0MB in the end (delta: 56.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.58ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 78.0MB in the end (delta: -708.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.41ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 74.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.57ms. Allocated memory is still 117.4MB. Free memory was 74.2MB in the beginning and 71.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1251.10ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 76.6MB in the end (delta: -5.6MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * TraceAbstraction took 377784.94ms. Allocated memory was 117.4MB in the beginning and 1.1GB in the end (delta: 983.6MB). Free memory was 76.1MB in the beginning and 807.6MB in the end (delta: -731.5MB). Peak memory consumption was 793.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.8s, 482 PlacesBefore, 131 PlacesAfterwards, 542 TransitionsBefore, 160 TransitionsAfterwards, 105672 CoEnabledTransitionPairs, 10 FixpointIterations, 69 TrivialSequentialCompositions, 324 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 137 ConcurrentYvCompositions, 31 ChoiceCompositions, 574 TotalNumberOfCompositions, 231267 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 103835, positive: 102183, positive conditional: 0, positive unconditional: 102183, negative: 1652, negative conditional: 0, negative unconditional: 1652, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 74191, positive: 73764, positive conditional: 0, positive unconditional: 73764, negative: 427, negative conditional: 0, negative unconditional: 427, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 74191, positive: 72526, positive conditional: 0, positive unconditional: 72526, negative: 1665, negative conditional: 0, negative unconditional: 1665, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1665, positive: 1238, positive conditional: 0, positive unconditional: 1238, negative: 416, negative conditional: 0, negative unconditional: 416, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30624, positive: 1076, positive conditional: 0, positive unconditional: 1076, negative: 1485, negative conditional: 0, negative unconditional: 1485, unknown: 28062, unknown conditional: 0, unknown unconditional: 28062] ], Cache Queries: [ total: 103835, positive: 28419, positive conditional: 0, positive unconditional: 28419, negative: 1225, negative conditional: 0, negative unconditional: 1225, unknown: 74191, unknown conditional: 0, unknown unconditional: 74191] , Statistics on independence cache: Total cache size (in pairs): 2582, Positive cache size: 2334, Positive conditional cache size: 0, Positive unconditional cache size: 2334, Negative cache size: 248, Negative conditional cache size: 0, Negative unconditional cache size: 248 - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-03 02:06:21,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:06:24,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:06:24,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:06:24,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:06:24,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:06:24,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:06:24,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:06:24,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:06:24,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:06:24,229 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:06:24,230 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:06:24,232 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:06:24,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:06:24,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:06:24,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:06:24,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:06:24,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:06:24,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:06:24,246 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:06:24,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:06:24,259 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:06:24,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:06:24,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:06:24,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:06:24,274 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:06:24,277 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:06:24,277 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:06:24,278 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:06:24,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:06:24,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:06:24,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:06:24,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:06:24,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:06:24,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:06:24,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:06:24,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:06:24,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:06:24,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:06:24,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:06:24,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:06:24,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:06:24,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 02:06:24,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:06:24,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:06:24,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:06:24,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:06:24,344 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:06:24,344 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:06:24,344 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:06:24,344 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:06:24,345 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:06:24,345 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:06:24,346 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:06:24,346 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:06:24,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:06:24,348 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:06:24,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:06:24,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:06:24,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:06:24,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:06:24,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:06:24,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:06:24,350 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:06:24,350 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:06:24,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:06:24,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:06:24,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:06:24,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:06:24,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:06:24,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:06:24,352 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:06:24,352 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:06:24,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:06:24,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:06:24,353 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:06:24,354 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:06:24,354 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:06:24,354 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:06:24,354 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:06:24,355 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:06:24,355 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 654ba073723c5bebcf706552b3cd58bc95cc07bc71a7e60391f80a16de89dbcb [2022-11-03 02:06:24,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:06:24,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:06:24,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:06:24,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:06:24,849 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:06:24,851 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:06:24,954 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/fe194ccf8/f8242ecb010b4206ab53b57a59f39707/FLAGbf3d4a098 [2022-11-03 02:06:25,607 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:06:25,612 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i [2022-11-03 02:06:25,636 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/fe194ccf8/f8242ecb010b4206ab53b57a59f39707/FLAGbf3d4a098 [2022-11-03 02:06:25,866 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/data/fe194ccf8/f8242ecb010b4206ab53b57a59f39707 [2022-11-03 02:06:25,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:06:25,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:06:25,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:06:25,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:06:25,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:06:25,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:06:25" (1/1) ... [2022-11-03 02:06:25,881 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e586bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:25, skipping insertion in model container [2022-11-03 02:06:25,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:06:25" (1/1) ... [2022-11-03 02:06:25,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:06:25,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:06:26,099 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:06:26,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:06:26,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:06:26,444 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:06:26,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:06:26,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:06:26,450 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:06:26,452 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:06:26,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:06:26,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:06:26,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:06:26,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:06:26,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:06:26,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:06:26,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:06:26,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:06:26,522 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:06:26,540 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:06:26,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30448,30461] [2022-11-03 02:06:26,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[30811,30824] [2022-11-03 02:06:26,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31483,31496] [2022-11-03 02:06:26,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31534,31547] [2022-11-03 02:06:26,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31683,31696] [2022-11-03 02:06:26,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31760,31773] [2022-11-03 02:06:26,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31807,31820] [2022-11-03 02:06:26,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[31916,31929] [2022-11-03 02:06:26,605 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32035,32048] [2022-11-03 02:06:26,607 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32083,32096] [2022-11-03 02:06:26,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32160,32173] [2022-11-03 02:06:26,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32286,32299] [2022-11-03 02:06:26,630 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32897,32910] [2022-11-03 02:06:26,631 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/sv-benchmarks/c/pthread-divine/one_time_barrier_twice_2t.i[32974,32987] [2022-11-03 02:06:26,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:06:26,689 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:06:26,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26 WrapperNode [2022-11-03 02:06:26,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:06:26,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:06:26,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:06:26,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:06:26,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,790 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 470 [2022-11-03 02:06:26,790 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:06:26,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:06:26,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:06:26,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:06:26,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,883 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:06:26,892 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:06:26,892 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:06:26,892 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:06:26,893 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (1/1) ... [2022-11-03 02:06:26,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:06:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:06:26,936 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:06:26,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:06:26,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-11-03 02:06:26,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:06:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:06:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-03 02:06:26,983 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-03 02:06:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:06:26,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:06:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:06:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:06:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-11-03 02:06:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:06:26,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:06:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:06:26,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:06:26,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:06:26,987 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:06:27,257 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:06:27,260 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:06:28,394 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:06:28,412 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:06:28,412 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-03 02:06:28,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:06:28 BoogieIcfgContainer [2022-11-03 02:06:28,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:06:28,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:06:28,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:06:28,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:06:28,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:06:25" (1/3) ... [2022-11-03 02:06:28,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db6ff74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:06:28, skipping insertion in model container [2022-11-03 02:06:28,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:06:26" (2/3) ... [2022-11-03 02:06:28,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db6ff74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:06:28, skipping insertion in model container [2022-11-03 02:06:28,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:06:28" (3/3) ... [2022-11-03 02:06:28,425 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_twice_2t.i [2022-11-03 02:06:28,434 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:06:28,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:06:28,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-11-03 02:06:28,446 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:06:28,657 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 02:06:28,727 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:06:28,751 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 483 places, 543 transitions, 1094 flow [2022-11-03 02:06:28,757 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 483 places, 543 transitions, 1094 flow [2022-11-03 02:06:28,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 483 places, 543 transitions, 1094 flow [2022-11-03 02:06:29,264 INFO L130 PetriNetUnfolder]: 95/796 cut-off events. [2022-11-03 02:06:29,265 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 02:06:29,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 796 events. 95/796 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2670 event pairs, 0 based on Foata normal form. 0/656 useless extension candidates. Maximal degree in co-relation 462. Up to 4 conditions per place. [2022-11-03 02:06:29,341 INFO L118 LiptonReduction]: Number of co-enabled transitions 105672 [2022-11-03 02:08:00,004 WARN L234 SmtUtils]: Spent 15.76s on a formula simplification. DAG size of input: 127 DAG size of output: 125 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:08:07,870 WARN L234 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:08:28,551 WARN L234 SmtUtils]: Spent 20.68s on a formula simplification. DAG size of input: 136 DAG size of output: 132 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:08:37,843 WARN L234 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 301] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-03 02:08:53,295 INFO L133 LiptonReduction]: Checked pairs total: 222659 [2022-11-03 02:08:53,295 INFO L135 LiptonReduction]: Total number of compositions: 578 [2022-11-03 02:08:53,305 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 158 transitions, 324 flow [2022-11-03 02:08:53,490 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3764 states, 3527 states have (on average 2.601644457045648) internal successors, (9176), 3763 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:53,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:08:53,515 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;@5bce0f10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:08:53,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2022-11-03 02:08:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 3764 states, 3527 states have (on average 2.601644457045648) internal successors, (9176), 3763 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:08:53,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:53,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:08:53,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:08:53,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 69305, now seen corresponding path program 1 times [2022-11-03 02:08:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:08:53,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906598137] [2022-11-03 02:08:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:08:53,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:08:53,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:08:53,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:08:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:53,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-03 02:08:53,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:53,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-03 02:08:53,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:08:53,730 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:08:53,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906598137] [2022-11-03 02:08:53,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906598137] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:08:53,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:08:53,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:08:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29017932] [2022-11-03 02:08:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:08:53,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:08:53,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:08:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:08:53,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:08:53,789 INFO L87 Difference]: Start difference. First operand has 3764 states, 3527 states have (on average 2.601644457045648) internal successors, (9176), 3763 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:54,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:08:54,803 INFO L93 Difference]: Finished difference Result 3762 states and 8379 transitions. [2022-11-03 02:08:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:08:54,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-03 02:08:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:08:54,874 INFO L225 Difference]: With dead ends: 3762 [2022-11-03 02:08:54,875 INFO L226 Difference]: Without dead ends: 3760 [2022-11-03 02:08:54,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:08:54,887 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:08:54,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 02:08:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-11-03 02:08:55,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 3760. [2022-11-03 02:08:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3760 states, 3527 states have (on average 2.3748227955769776) internal successors, (8376), 3759 states have internal predecessors, (8376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3760 states to 3760 states and 8376 transitions. [2022-11-03 02:08:55,162 INFO L78 Accepts]: Start accepts. Automaton has 3760 states and 8376 transitions. Word has length 2 [2022-11-03 02:08:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:08:55,163 INFO L495 AbstractCegarLoop]: Abstraction has 3760 states and 8376 transitions. [2022-11-03 02:08:55,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3760 states and 8376 transitions. [2022-11-03 02:08:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:08:55,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:55,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:08:55,190 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:08:55,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:08:55,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:08:55,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2067088247, now seen corresponding path program 1 times [2022-11-03 02:08:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:08:55,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262356102] [2022-11-03 02:08:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:08:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:08:55,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:08:55,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:08:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:55,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:08:55,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:08:55,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:08:55,622 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:08:55,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262356102] [2022-11-03 02:08:55,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262356102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:08:55,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:08:55,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:08:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57015166] [2022-11-03 02:08:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:08:55,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:08:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:08:55,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:08:55,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:08:55,626 INFO L87 Difference]: Start difference. First operand 3760 states and 8376 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:08:57,316 INFO L93 Difference]: Finished difference Result 3761 states and 8377 transitions. [2022-11-03 02:08:57,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:08:57,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:08:57,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:08:57,338 INFO L225 Difference]: With dead ends: 3761 [2022-11-03 02:08:57,338 INFO L226 Difference]: Without dead ends: 3761 [2022-11-03 02:08:57,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:08:57,344 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:08:57,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:08:57,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states. [2022-11-03 02:08:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3761. [2022-11-03 02:08:57,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3761 states, 3528 states have (on average 2.374433106575964) internal successors, (8377), 3760 states have internal predecessors, (8377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 8377 transitions. [2022-11-03 02:08:57,510 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 8377 transitions. Word has length 5 [2022-11-03 02:08:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:08:57,511 INFO L495 AbstractCegarLoop]: Abstraction has 3761 states and 8377 transitions. [2022-11-03 02:08:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:08:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 8377 transitions. [2022-11-03 02:08:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:08:57,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:08:57,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:08:57,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:08:57,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:08:57,733 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:08:57,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:08:57,734 INFO L85 PathProgramCache]: Analyzing trace with hash -416867723, now seen corresponding path program 1 times [2022-11-03 02:08:57,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:08:57,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208158128] [2022-11-03 02:08:57,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:57,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:08:57,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:08:57,736 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:08:57,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:08:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:58,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:08:58,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:58,056 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-03 02:08:58,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:08:58,123 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-03 02:08:58,123 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:08:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208158128] [2022-11-03 02:08:58,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208158128] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:08:58,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [690256240] [2022-11-03 02:08:58,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:08:58,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:08:58,130 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:08:58,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-03 02:08:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:58,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:08:58,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:58,501 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-03 02:08:58,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:08:58,518 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-03 02:08:58,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [690256240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:08:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990864129] [2022-11-03 02:08:58,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:08:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:08:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:08:58,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:08:58,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:08:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:08:58,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:08:58,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:08:58,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:08:58,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:08:58,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990864129] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:08:58,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 4 imperfect interpolant sequences. [2022-11-03 02:08:58,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3, 3] total 7 [2022-11-03 02:08:58,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942584590] [2022-11-03 02:08:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:08:58,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:08:58,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:08:58,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:08:58,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:08:58,758 INFO L87 Difference]: Start difference. First operand 3761 states and 8377 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:00,352 INFO L93 Difference]: Finished difference Result 3706 states and 8313 transitions. [2022-11-03 02:09:00,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:09:00,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-03 02:09:00,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:00,374 INFO L225 Difference]: With dead ends: 3706 [2022-11-03 02:09:00,375 INFO L226 Difference]: Without dead ends: 3706 [2022-11-03 02:09:00,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:09:00,376 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:00,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 22 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 02:09:00,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2022-11-03 02:09:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2022-11-03 02:09:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3485 states have (on average 2.3853658536585365) internal successors, (8313), 3705 states have internal predecessors, (8313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 8313 transitions. [2022-11-03 02:09:00,527 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 8313 transitions. Word has length 6 [2022-11-03 02:09:00,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:00,528 INFO L495 AbstractCegarLoop]: Abstraction has 3706 states and 8313 transitions. [2022-11-03 02:09:00,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 8313 transitions. [2022-11-03 02:09:00,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:09:00,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:00,530 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:00,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:00,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:01,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:01,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:01,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:09:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1216393144, now seen corresponding path program 1 times [2022-11-03 02:09:01,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:01,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265260127] [2022-11-03 02:09:01,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:01,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:01,137 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:01,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:01,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:09:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:01,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:09:01,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:09:01,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:09:01,426 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:01,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265260127] [2022-11-03 02:09:01,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265260127] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:01,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1385625764] [2022-11-03 02:09:01,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:01,427 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:01,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:01,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:01,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-11-03 02:09:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:01,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:09:01,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:01,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:09:01,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:09:01,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1385625764] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:01,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935859210] [2022-11-03 02:09:01,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:01,750 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:01,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:09:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:01,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:09:01,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:02,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:02,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935859210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:02,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:02,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3, 3, 4, 4] total 10 [2022-11-03 02:09:02,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287799876] [2022-11-03 02:09:02,327 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:02,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:09:02,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:02,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:09:02,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:09:02,329 INFO L87 Difference]: Start difference. First operand 3706 states and 8313 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:06,481 INFO L93 Difference]: Finished difference Result 3595 states and 8076 transitions. [2022-11-03 02:09:06,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:09:06,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 02:09:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:06,498 INFO L225 Difference]: With dead ends: 3595 [2022-11-03 02:09:06,499 INFO L226 Difference]: Without dead ends: 3595 [2022-11-03 02:09:06,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:09:06,500 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 471 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:06,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 68 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-03 02:09:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3595 states. [2022-11-03 02:09:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3595 to 3595. [2022-11-03 02:09:06,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3595 states, 3387 states have (on average 2.3844109831709477) internal successors, (8076), 3594 states have internal predecessors, (8076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3595 states to 3595 states and 8076 transitions. [2022-11-03 02:09:06,590 INFO L78 Accepts]: Start accepts. Automaton has 3595 states and 8076 transitions. Word has length 8 [2022-11-03 02:09:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:06,591 INFO L495 AbstractCegarLoop]: Abstraction has 3595 states and 8076 transitions. [2022-11-03 02:09:06,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:06,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3595 states and 8076 transitions. [2022-11-03 02:09:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:09:06,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:06,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:06,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:06,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:07,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:07,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:07,212 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:09:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1537687723, now seen corresponding path program 1 times [2022-11-03 02:09:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:07,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862412831] [2022-11-03 02:09:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:07,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:07,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:07,214 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:07,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:09:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:07,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:09:07,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:07,898 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:07,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:08,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:08,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:08,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:09,035 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:09,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:09,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:09,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:09,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:09,552 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_546) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:09,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_545) |c_~#pre~0.base| v_ArrVal_546) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:09,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_208| (_ BitVec 32)) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_544) |v_ULTIMATE.start_main_~#worker~0#1.base_208| v_ArrVal_545) |c_~#pre~0.base| v_ArrVal_546) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_208|))))) is different from false [2022-11-03 02:09:09,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_208| (_ BitVec 32)) (v_ArrVal_543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_545 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_546 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_208|))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_543) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_544) |v_ULTIMATE.start_main_~#worker~0#1.base_208| v_ArrVal_545) |c_~#pre~0.base| v_ArrVal_546) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:09:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:09,764 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:09,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862412831] [2022-11-03 02:09:09,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862412831] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:09,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717094679] [2022-11-03 02:09:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:09,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:09,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:09,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:09,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-11-03 02:09:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:11,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:09:11,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:12,052 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:12,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:12,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:12,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:12,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:12,750 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:12,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:12,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:12,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:12,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:12,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_645) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:13,021 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_644) |c_~#pre~0.base| v_ArrVal_645) |c_~#in~0.base|) |c_~#in~0.offset|)))) is different from false [2022-11-03 02:09:13,080 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_209| (_ BitVec 32)) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_643) |v_ULTIMATE.start_main_~#worker~0#1.base_209| v_ArrVal_644) |c_~#pre~0.base| v_ArrVal_645) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_209|) (_ bv0 1))))) is different from false [2022-11-03 02:09:13,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_640 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_209| (_ BitVec 32)) (v_ArrVal_642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_643 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_645 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_642) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_643) |v_ULTIMATE.start_main_~#worker~0#1.base_209| v_ArrVal_644) |c_~#pre~0.base| v_ArrVal_645) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_209|) (_ bv0 1))))) is different from false [2022-11-03 02:09:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:13,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1717094679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:13,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572179645] [2022-11-03 02:09:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:13,164 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:09:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:13,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:09:13,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:13,742 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:13,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:13,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:14,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:14,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:14,407 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:14,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:14,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:14,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:14,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:14,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:14,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_742) |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:14,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_210| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_741) |v_ULTIMATE.start_main_~#worker~0#1.base_210| v_ArrVal_742) |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_210|))))) is different from false [2022-11-03 02:09:14,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_738 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_210| (_ BitVec 32)) (v_ArrVal_743 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_738) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_741) |v_ULTIMATE.start_main_~#worker~0#1.base_210| v_ArrVal_742) |c_~#pre~0.base| v_ArrVal_743) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_210|))))) is different from false [2022-11-03 02:09:14,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572179645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:14,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 18 [2022-11-03 02:09:14,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903504876] [2022-11-03 02:09:14,788 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:14,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:09:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:14,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:09:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=50, Unknown=12, NotChecked=276, Total=380 [2022-11-03 02:09:14,789 INFO L87 Difference]: Start difference. First operand 3595 states and 8076 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:20,749 INFO L93 Difference]: Finished difference Result 3736 states and 8375 transitions. [2022-11-03 02:09:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:09:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-03 02:09:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:20,770 INFO L225 Difference]: With dead ends: 3736 [2022-11-03 02:09:20,771 INFO L226 Difference]: Without dead ends: 3736 [2022-11-03 02:09:20,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=66, Invalid=80, Unknown=12, NotChecked=348, Total=506 [2022-11-03 02:09:20,772 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 152 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2632 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:20,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 54 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 757 Invalid, 0 Unknown, 2632 Unchecked, 5.2s Time] [2022-11-03 02:09:20,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3736 states. [2022-11-03 02:09:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3736 to 3608. [2022-11-03 02:09:20,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3608 states, 3400 states have (on average 2.383235294117647) internal successors, (8103), 3607 states have internal predecessors, (8103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:20,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3608 states to 3608 states and 8103 transitions. [2022-11-03 02:09:20,881 INFO L78 Accepts]: Start accepts. Automaton has 3608 states and 8103 transitions. Word has length 9 [2022-11-03 02:09:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:20,882 INFO L495 AbstractCegarLoop]: Abstraction has 3608 states and 8103 transitions. [2022-11-03 02:09:20,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:20,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3608 states and 8103 transitions. [2022-11-03 02:09:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:09:20,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:20,883 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:20,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:21,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:21,325 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:21,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:09:21,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:09:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 427656520, now seen corresponding path program 1 times [2022-11-03 02:09:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:21,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805835295] [2022-11-03 02:09:21,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:21,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:21,502 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:21,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 02:09:21,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:21,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:09:21,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:22,245 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:22,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:22,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:22,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:22,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:23,140 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:23,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:23,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:23,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:23,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:23,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_842) |c_~#in~0.base|) |c_~#in~0.offset|)))) is different from false [2022-11-03 02:09:23,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_841) |c_~#pre~0.base| v_ArrVal_842) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:23,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_211| (_ BitVec 32)) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_211|))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_839) |v_ULTIMATE.start_main_~#worker~0#1.base_211| v_ArrVal_841) |c_~#pre~0.base| v_ArrVal_842) |c_~#in~0.base|) |c_~#in~0.offset|))))) is different from false [2022-11-03 02:09:23,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_839 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_211| (_ BitVec 32)) (v_ArrVal_836 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_211|))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_836) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_839) |v_ULTIMATE.start_main_~#worker~0#1.base_211| v_ArrVal_841) |c_~#pre~0.base| v_ArrVal_842) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:09:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:23,780 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:23,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805835295] [2022-11-03 02:09:23,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805835295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:23,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [64926269] [2022-11-03 02:09:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:23,784 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:23,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-11-03 02:09:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:25,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:09:25,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:25,287 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:25,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:25,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:25,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:25,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:25,877 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:25,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:25,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:26,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:26,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:26,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_941) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:26,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_940) |c_~#pre~0.base| v_ArrVal_941) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:26,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_212| (_ BitVec 32)) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_939) |v_ULTIMATE.start_main_~#worker~0#1.base_212| v_ArrVal_940) |c_~#pre~0.base| v_ArrVal_941) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_212|))))) is different from false [2022-11-03 02:09:26,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_939 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_212| (_ BitVec 32)) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_938) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_939) |v_ULTIMATE.start_main_~#worker~0#1.base_212| v_ArrVal_940) |c_~#pre~0.base| v_ArrVal_941) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_212|))))) is different from false [2022-11-03 02:09:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:26,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [64926269] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:26,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281192072] [2022-11-03 02:09:26,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:26,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:26,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:26,278 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:26,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:09:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:26,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:09:26,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:26,778 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:26,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:27,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:27,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:27,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:27,615 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:09:27,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:09:27,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:27,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:27,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:27,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:27,823 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1039) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:27,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1038) |c_~#pre~0.base| v_ArrVal_1039) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:27,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1037 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_213| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_213|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1037) |v_ULTIMATE.start_main_~#worker~0#1.base_213| v_ArrVal_1038) |c_~#pre~0.base| v_ArrVal_1039) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:09:27,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1036 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1037 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_213| (_ BitVec 32))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1037) |v_ULTIMATE.start_main_~#worker~0#1.base_213| v_ArrVal_1038) |c_~#pre~0.base| v_ArrVal_1039) |c_~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_213|))))) is different from false [2022-11-03 02:09:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:27,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281192072] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:27,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:27,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 20 [2022-11-03 02:09:27,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260185919] [2022-11-03 02:09:27,983 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:27,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:09:27,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:27,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:09:27,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=74, Unknown=12, NotChecked=324, Total=462 [2022-11-03 02:09:27,985 INFO L87 Difference]: Start difference. First operand 3608 states and 8103 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:32,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:09:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:36,437 INFO L93 Difference]: Finished difference Result 3735 states and 8372 transitions. [2022-11-03 02:09:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:09:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:09:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:36,456 INFO L225 Difference]: With dead ends: 3735 [2022-11-03 02:09:36,456 INFO L226 Difference]: Without dead ends: 3735 [2022-11-03 02:09:36,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=67, Invalid=101, Unknown=12, NotChecked=372, Total=552 [2022-11-03 02:09:36,457 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 110 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2479 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:36,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 81 Invalid, 3390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 896 Invalid, 1 Unknown, 2479 Unchecked, 7.8s Time] [2022-11-03 02:09:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3735 states. [2022-11-03 02:09:36,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3735 to 3621. [2022-11-03 02:09:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3621 states, 3413 states have (on average 2.3820685613829475) internal successors, (8130), 3620 states have internal predecessors, (8130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3621 states to 3621 states and 8130 transitions. [2022-11-03 02:09:36,573 INFO L78 Accepts]: Start accepts. Automaton has 3621 states and 8130 transitions. Word has length 10 [2022-11-03 02:09:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:36,574 INFO L495 AbstractCegarLoop]: Abstraction has 3621 states and 8130 transitions. [2022-11-03 02:09:36,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 3621 states and 8130 transitions. [2022-11-03 02:09:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:09:36,575 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:36,575 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:36,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:36,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-11-03 02:09:36,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:37,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:37,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:09:37,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:37,188 INFO L85 PathProgramCache]: Analyzing trace with hash 423682852, now seen corresponding path program 1 times [2022-11-03 02:09:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:37,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103902116] [2022-11-03 02:09:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:37,191 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:37,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-03 02:09:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:37,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:09:37,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:37,957 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:37,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:38,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:38,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:38,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:09:38,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:09:38,669 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:09:38,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:09:38,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:09:39,270 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:09:39,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-11-03 02:09:39,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:39,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:39,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1142) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:39,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1141) |c_~#pre~0.base| v_ArrVal_1142) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:39,641 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_214| (_ BitVec 32))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1138) |v_ULTIMATE.start_main_~#worker~0#1.base_214| v_ArrVal_1141) |c_~#pre~0.base| v_ArrVal_1142) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_214|) (_ bv0 1))))) is different from false [2022-11-03 02:09:39,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1132 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1138 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_214| (_ BitVec 32))) (or (= ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1132))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1138) |v_ULTIMATE.start_main_~#worker~0#1.base_214| v_ArrVal_1141) |c_~#pre~0.base| v_ArrVal_1142) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_214|) (_ bv0 1))))) is different from false [2022-11-03 02:09:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:39,754 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103902116] [2022-11-03 02:09:39,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1103902116] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1459260462] [2022-11-03 02:09:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:39,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:39,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:39,757 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:39,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-11-03 02:09:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:41,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:09:41,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:41,418 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:09:41,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 72 treesize of output 101 [2022-11-03 02:09:41,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:41,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:42,044 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:09:42,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:09:42,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:09:42,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:42,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:42,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:42,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1240))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))) is different from false [2022-11-03 02:09:42,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1239) |c_~#pre~0.base| v_ArrVal_1240))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:09:42,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1237 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_215| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1237) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1238) |v_ULTIMATE.start_main_~#worker~0#1.base_215| v_ArrVal_1239) |c_~#pre~0.base| v_ArrVal_1240))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_215|) (_ bv0 1)))))) is different from false [2022-11-03 02:09:42,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1235 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_215| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1235) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1237) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1238) |v_ULTIMATE.start_main_~#worker~0#1.base_215| v_ArrVal_1239) |c_~#pre~0.base| v_ArrVal_1240))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_215|) (_ bv0 1)))))) is different from false [2022-11-03 02:09:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:43,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1459260462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547712888] [2022-11-03 02:09:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:43,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:43,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:43,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:43,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:09:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:43,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:09:43,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:43,624 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:43,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:43,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:44,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:44,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:09:44,627 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:44,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:44,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:44,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:44,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:44,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:44,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1338) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:44,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1337) |c_~#pre~0.base| v_ArrVal_1338) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:44,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_216| (_ BitVec 32)) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1335) |v_ULTIMATE.start_main_~#worker~0#1.base_216| v_ArrVal_1337) |c_~#pre~0.base| v_ArrVal_1338) |c_~#post~0.base|) |c_~#post~0.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_216|))))) is different from false [2022-11-03 02:09:45,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1332 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1335 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1336 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_216| (_ BitVec 32)) (v_ArrVal_1337 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1338 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1332) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1335) |v_ULTIMATE.start_main_~#worker~0#1.base_216| v_ArrVal_1337) |c_~#pre~0.base| v_ArrVal_1338) |c_~#post~0.base|) |c_~#post~0.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_216|))))) is different from false [2022-11-03 02:09:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:09:45,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547712888] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:45,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:45,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6, 5, 5] total 25 [2022-11-03 02:09:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459982993] [2022-11-03 02:09:45,039 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:45,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:09:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:09:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=169, Unknown=12, NotChecked=444, Total=702 [2022-11-03 02:09:45,040 INFO L87 Difference]: Start difference. First operand 3621 states and 8130 transitions. Second operand has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:09:49,456 INFO L93 Difference]: Finished difference Result 3626 states and 8140 transitions. [2022-11-03 02:09:49,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:09:49,457 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:09:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:09:49,470 INFO L225 Difference]: With dead ends: 3626 [2022-11-03 02:09:49,470 INFO L226 Difference]: Without dead ends: 3626 [2022-11-03 02:09:49,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=96, Invalid=212, Unknown=12, NotChecked=492, Total=812 [2022-11-03 02:09:49,472 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1777 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:09:49,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 58 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 536 Invalid, 0 Unknown, 1777 Unchecked, 3.6s Time] [2022-11-03 02:09:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2022-11-03 02:09:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 3626. [2022-11-03 02:09:49,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3418 states have (on average 2.3815096547688706) internal successors, (8140), 3625 states have internal predecessors, (8140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 8140 transitions. [2022-11-03 02:09:49,570 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 8140 transitions. Word has length 10 [2022-11-03 02:09:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:09:49,570 INFO L495 AbstractCegarLoop]: Abstraction has 3626 states and 8140 transitions. [2022-11-03 02:09:49,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 26 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:09:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 8140 transitions. [2022-11-03 02:09:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:09:49,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:09:49,571 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:09:49,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:49,834 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:49,996 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:09:50,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:50,192 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:09:50,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:09:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 372455872, now seen corresponding path program 1 times [2022-11-03 02:09:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:09:50,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544099614] [2022-11-03 02:09:50,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:50,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:09:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:09:50,194 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:09:50,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 02:09:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:50,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:09:50,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:50,788 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:50,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:51,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:51,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:51,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:09:51,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:09:51,552 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:09:51,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:09:51,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:09:52,099 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:09:52,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-11-03 02:09:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:52,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:52,338 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1443 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1443) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:52,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1443 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1442) |c_~#pre~0.base| v_ArrVal_1443) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:52,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_217| (_ BitVec 32)) (v_ArrVal_1442 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1437) |v_ULTIMATE.start_main_~#worker~0#1.base_217| v_ArrVal_1442) |c_~#pre~0.base| v_ArrVal_1443) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_217|))))) is different from false [2022-11-03 02:09:52,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_217| (_ BitVec 32)) (v_ArrVal_1442 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1437 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1432))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1437) |v_ULTIMATE.start_main_~#worker~0#1.base_217| v_ArrVal_1442) |c_~#pre~0.base| v_ArrVal_1443) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_217|))))) is different from false [2022-11-03 02:09:52,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:52,567 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:09:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544099614] [2022-11-03 02:09:52,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544099614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:52,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [163337953] [2022-11-03 02:09:52,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:52,567 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:09:52,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:09:52,568 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:09:52,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-11-03 02:09:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:53,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:09:53,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:53,906 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:09:53,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:09:54,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:54,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:54,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:09:54,516 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:09:54,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:09:54,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:54,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:54,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:55,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1543))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:09:55,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1542) |c_~#pre~0.base| v_ArrVal_1543))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:09:55,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_218| (_ BitVec 32)) (v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1541 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1540) |v_ULTIMATE.start_main_~#worker~0#1.base_218| v_ArrVal_1542) |c_~#pre~0.base| v_ArrVal_1543))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_218|)))))) is different from false [2022-11-03 02:09:55,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_218| (_ BitVec 32)) (v_ArrVal_1540 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1541 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1543 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1538 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1538) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1541) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1540) |v_ULTIMATE.start_main_~#worker~0#1.base_218| v_ArrVal_1542) |c_~#pre~0.base| v_ArrVal_1543))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_218|))) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)))))) is different from false [2022-11-03 02:09:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:55,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [163337953] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:55,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970291645] [2022-11-03 02:09:55,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:09:55,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:09:55,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:09:55,286 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:09:55,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-03 02:09:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:09:55,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-03 02:09:55,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:09:55,749 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:09:55,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:09:55,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:56,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:56,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:09:56,366 INFO L356 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-03 02:09:56,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 02:09:56,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:56,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:09:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:09:56,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:09:56,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1641) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:56,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1640) |c_~#pre~0.base| v_ArrVal_1641) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:09:56,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_219| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1638) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1639) |v_ULTIMATE.start_main_~#worker~0#1.base_219| v_ArrVal_1640) |c_~#pre~0.base| v_ArrVal_1641) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_219|) (_ bv0 1))))) is different from false [2022-11-03 02:09:56,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_219| (_ BitVec 32)) (v_ArrVal_1638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1640 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1641 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1638) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1639) |v_ULTIMATE.start_main_~#worker~0#1.base_219| v_ArrVal_1640) |c_~#pre~0.base| v_ArrVal_1641) |c_~#post~0.base|) |c_~#post~0.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_219|) (_ bv0 1))))) is different from false [2022-11-03 02:09:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:09:56,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970291645] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:09:56,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:09:56,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6, 5, 5] total 25 [2022-11-03 02:09:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141177866] [2022-11-03 02:09:56,742 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:09:56,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:09:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:09:56,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:09:56,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=169, Unknown=12, NotChecked=444, Total=702 [2022-11-03 02:09:56,744 INFO L87 Difference]: Start difference. First operand 3626 states and 8140 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:01,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:01,219 INFO L93 Difference]: Finished difference Result 3629 states and 8146 transitions. [2022-11-03 02:10:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:10:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:10:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:01,233 INFO L225 Difference]: With dead ends: 3629 [2022-11-03 02:10:01,233 INFO L226 Difference]: Without dead ends: 3629 [2022-11-03 02:10:01,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=96, Invalid=212, Unknown=12, NotChecked=492, Total=812 [2022-11-03 02:10:01,234 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1886 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:01,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 64 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 664 Invalid, 0 Unknown, 1886 Unchecked, 3.8s Time] [2022-11-03 02:10:01,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3629 states. [2022-11-03 02:10:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3629 to 3629. [2022-11-03 02:10:01,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3629 states, 3421 states have (on average 2.3811750950014616) internal successors, (8146), 3628 states have internal predecessors, (8146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 8146 transitions. [2022-11-03 02:10:01,372 INFO L78 Accepts]: Start accepts. Automaton has 3629 states and 8146 transitions. Word has length 11 [2022-11-03 02:10:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:01,373 INFO L495 AbstractCegarLoop]: Abstraction has 3629 states and 8146 transitions. [2022-11-03 02:10:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3629 states and 8146 transitions. [2022-11-03 02:10:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:10:01,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:01,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:01,388 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:01,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:01,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:01,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:01,982 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:10:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash 366093564, now seen corresponding path program 1 times [2022-11-03 02:10:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:10:01,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813042040] [2022-11-03 02:10:01,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:01,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:10:01,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:10:01,984 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:10:01,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 02:10:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:02,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-03 02:10:02,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:02,597 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:10:02,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:10:02,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:02,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:03,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 34 [2022-11-03 02:10:03,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:10:03,171 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:10:03,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:10:03,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 34 [2022-11-03 02:10:03,667 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:10:03,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 38 [2022-11-03 02:10:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:03,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:03,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1744 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1744) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:10:03,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1744 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1743) |c_~#pre~0.base| v_ArrVal_1744) |c_~#post~0.base|) |c_~#post~0.offset|)))) is different from false [2022-11-03 02:10:04,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1743 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_220| (_ BitVec 32)) (v_ArrVal_1744 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_220|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1739) |v_ULTIMATE.start_main_~#worker~0#1.base_220| v_ArrVal_1743) |c_~#pre~0.base| v_ArrVal_1744) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:10:04,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1739 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_1743 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_220| (_ BitVec 32)) (v_ArrVal_1733 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1744 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_220|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1733))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1739) |v_ULTIMATE.start_main_~#worker~0#1.base_220| v_ArrVal_1743) |c_~#pre~0.base| v_ArrVal_1744) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:10:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:04,146 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:10:04,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813042040] [2022-11-03 02:10:04,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813042040] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:04,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1536926095] [2022-11-03 02:10:04,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:04,146 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:10:04,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:10:04,147 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:10:04,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-11-03 02:10:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:05,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:10:05,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:05,966 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:10:05,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:10:06,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:06,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:06,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:10:06,396 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:10:06,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:10:06,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:06,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:06,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:06,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:06,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1843))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:10:06,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1842) |c_~#pre~0.base| v_ArrVal_1843))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))) is different from false [2022-11-03 02:10:07,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1841 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1840 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_221| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1841) |v_ULTIMATE.start_main_~#worker~0#1.base_221| v_ArrVal_1842) |c_~#pre~0.base| v_ArrVal_1843))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_221|)))))) is different from false [2022-11-03 02:10:07,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1838 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1841 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1840 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_221| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1838) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1841) |v_ULTIMATE.start_main_~#worker~0#1.base_221| v_ArrVal_1842) |c_~#pre~0.base| v_ArrVal_1843))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_221|)))))) is different from false [2022-11-03 02:10:07,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:07,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1536926095] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:07,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772533409] [2022-11-03 02:10:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:07,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:07,136 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:07,164 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-03 02:10:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:07,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:10:07,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:07,743 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:10:07,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:10:08,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:08,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:08,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:10:08,449 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:10:08,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:10:08,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:08,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:10:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:08,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:08,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1941) |c_~#post~0.base|) |c_~#post~0.offset|)))) is different from false [2022-11-03 02:10:08,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1940) |c_~#pre~0.base| v_ArrVal_1941) |c_~#post~0.base|) |c_~#post~0.offset|)))) is different from false [2022-11-03 02:10:08,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_222| (_ BitVec 32)) (v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_222|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1938) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1939) |v_ULTIMATE.start_main_~#worker~0#1.base_222| v_ArrVal_1940) |c_~#pre~0.base| v_ArrVal_1941) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:10:08,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1939 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_222| (_ BitVec 32)) (v_ArrVal_1940 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1941 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_222|))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_1937) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_1938) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_1939) |v_ULTIMATE.start_main_~#worker~0#1.base_222| v_ArrVal_1940) |c_~#pre~0.base| v_ArrVal_1941) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:10:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772533409] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:08,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:10:08,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6, 5, 5] total 23 [2022-11-03 02:10:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117519820] [2022-11-03 02:10:08,855 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:08,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:10:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:10:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:10:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=131, Unknown=12, NotChecked=396, Total=600 [2022-11-03 02:10:08,856 INFO L87 Difference]: Start difference. First operand 3629 states and 8146 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:12,751 INFO L93 Difference]: Finished difference Result 3632 states and 8152 transitions. [2022-11-03 02:10:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:10:12,752 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:10:12,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:12,764 INFO L225 Difference]: With dead ends: 3632 [2022-11-03 02:10:12,765 INFO L226 Difference]: Without dead ends: 3632 [2022-11-03 02:10:12,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=83, Invalid=193, Unknown=12, NotChecked=468, Total=756 [2022-11-03 02:10:12,766 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2083 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:12,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 530 Invalid, 0 Unknown, 2083 Unchecked, 2.8s Time] [2022-11-03 02:10:12,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2022-11-03 02:10:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3628. [2022-11-03 02:10:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3628 states, 3420 states have (on average 2.3812865497076023) internal successors, (8144), 3627 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3628 states to 3628 states and 8144 transitions. [2022-11-03 02:10:12,877 INFO L78 Accepts]: Start accepts. Automaton has 3628 states and 8144 transitions. Word has length 11 [2022-11-03 02:10:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:10:12,877 INFO L495 AbstractCegarLoop]: Abstraction has 3628 states and 8144 transitions. [2022-11-03 02:10:12,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:12,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3628 states and 8144 transitions. [2022-11-03 02:10:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:10:12,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:10:12,879 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:10:12,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:13,115 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:13,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:10:13,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:13,488 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:10:13,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:10:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash 249272462, now seen corresponding path program 1 times [2022-11-03 02:10:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:10:13,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [415789346] [2022-11-03 02:10:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:13,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:10:13,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:10:13,490 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:10:13,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 02:10:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:13,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:10:13,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:14,162 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:10:14,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:10:14,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:10:14,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:10:14,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:10:14,973 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:10:14,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:10:15,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:10:15,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:10:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:15,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:15,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2040 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2040) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:10:15,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2039 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2039) |c_~#pre~0.base| v_ArrVal_2040) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:10:15,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2039 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_223| (_ BitVec 32)) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2038 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_223|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2037) |v_ULTIMATE.start_main_~#worker~0#1.base_223| v_ArrVal_2039) |c_~#pre~0.base| v_ArrVal_2040) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))) is different from false [2022-11-03 02:10:15,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2040 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2039 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_223| (_ BitVec 32)) (v_ArrVal_2037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2038 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_223|))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2035) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2038) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2037) |v_ULTIMATE.start_main_~#worker~0#1.base_223| v_ArrVal_2039) |c_~#pre~0.base| v_ArrVal_2040) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))) is different from false [2022-11-03 02:10:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:15,819 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:10:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [415789346] [2022-11-03 02:10:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [415789346] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:15,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1099485042] [2022-11-03 02:10:15,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:15,820 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:10:15,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:10:15,823 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:10:15,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-11-03 02:10:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:18,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:10:18,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:18,411 INFO L356 Elim1Store]: treesize reduction 226, result has 19.0 percent of original size [2022-11-03 02:10:18,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 91 [2022-11-03 02:10:19,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:10:19,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:10:19,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:10:19,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2022-11-03 02:10:19,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 44 treesize of output 24 [2022-11-03 02:10:20,094 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:10:20,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:10:20,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:10:20,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:10:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:10:21,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:21,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2146))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))))))) is different from false [2022-11-03 02:10:21,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2146 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2145) |c_~#pre~0.base| v_ArrVal_2146))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))))))) is different from false [2022-11-03 02:10:21,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2143 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_224| (_ BitVec 32))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2142) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2143) |v_ULTIMATE.start_main_~#worker~0#1.base_224| v_ArrVal_2145) |c_~#pre~0.base| v_ArrVal_2146))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 |c_~#in~0.offset|)) (_ bv0 8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_224|))) (not (= ((_ extract 7 0) (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse0 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))))) is different from false [2022-11-03 02:10:21,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2145 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2146 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2137 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_224| (_ BitVec 32))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2137) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2142) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2143) |v_ULTIMATE.start_main_~#worker~0#1.base_224| v_ArrVal_2145) |c_~#pre~0.base| v_ArrVal_2146))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_224|))) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|)))))))) is different from false [2022-11-03 02:10:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:22,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1099485042] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:22,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661048768] [2022-11-03 02:10:22,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:10:22,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:10:22,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:10:22,021 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:10:22,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-03 02:10:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:10:22,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:10:22,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:10:22,628 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:10:22,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:10:23,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:10:23,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:10:23,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-03 02:10:23,614 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:10:23,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:10:23,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:10:24,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:10:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:10:24,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:10:24,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2244 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2244) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:10:24,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2243 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2243) |c_~#pre~0.base| v_ArrVal_2244) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:10:24,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2243 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_225| (_ BitVec 32))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2242) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2241) |v_ULTIMATE.start_main_~#worker~0#1.base_225| v_ArrVal_2243) |c_~#pre~0.base| v_ArrVal_2244) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_225|) (_ bv0 1))))) is different from false [2022-11-03 02:10:24,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2241 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2239 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_225| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_225|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2239) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2242) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2241) |v_ULTIMATE.start_main_~#worker~0#1.base_225| v_ArrVal_2243) |c_~#pre~0.base| v_ArrVal_2244) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))) is different from false [2022-11-03 02:10:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:10:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661048768] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:10:24,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:10:24,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 7, 6, 6] total 36 [2022-11-03 02:10:24,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613321020] [2022-11-03 02:10:24,560 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:10:24,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 02:10:24,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:10:24,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 02:10:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=558, Unknown=12, NotChecked=708, Total=1406 [2022-11-03 02:10:24,567 INFO L87 Difference]: Start difference. First operand 3628 states and 8144 transitions. Second operand has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:10:33,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:35,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:38,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:40,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:10:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:10:59,949 INFO L93 Difference]: Finished difference Result 4153 states and 9146 transitions. [2022-11-03 02:10:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:10:59,950 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 02:10:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:10:59,959 INFO L225 Difference]: With dead ends: 4153 [2022-11-03 02:10:59,959 INFO L226 Difference]: Without dead ends: 4153 [2022-11-03 02:10:59,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=310, Invalid=1366, Unknown=12, NotChecked=1068, Total=2756 [2022-11-03 02:10:59,961 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 494 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 58 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 8938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 5166 IncrementalHoareTripleChecker+Unchecked, 28.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:10:59,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 78 Invalid, 8938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3710 Invalid, 4 Unknown, 5166 Unchecked, 28.8s Time] [2022-11-03 02:10:59,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2022-11-03 02:11:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 3716. [2022-11-03 02:11:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3716 states, 3508 states have (on average 2.3762827822120864) internal successors, (8336), 3715 states have internal predecessors, (8336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:00,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3716 states to 3716 states and 8336 transitions. [2022-11-03 02:11:00,057 INFO L78 Accepts]: Start accepts. Automaton has 3716 states and 8336 transitions. Word has length 11 [2022-11-03 02:11:00,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:00,058 INFO L495 AbstractCegarLoop]: Abstraction has 3716 states and 8336 transitions. [2022-11-03 02:11:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 3716 states and 8336 transitions. [2022-11-03 02:11:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:11:00,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:00,059 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:00,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:00,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:00,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:00,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:00,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:11:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1338762787, now seen corresponding path program 1 times [2022-11-03 02:11:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:11:00,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40658895] [2022-11-03 02:11:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:00,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:11:00,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:11:00,680 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:11:00,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-11-03 02:11:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:01,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-03 02:11:01,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:01,426 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:11:01,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:11:01,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:11:01,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:11:02,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:11:02,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2022-11-03 02:11:02,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:11:02,251 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:11:02,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:11:02,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:11:02,834 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:11:02,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 02:11:03,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:03,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:03,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2349) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:11:03,342 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2348) |c_~#pre~0.base| v_ArrVal_2349) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:11:03,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_226| (_ BitVec 32)) (v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2344) |v_ULTIMATE.start_main_~#worker~0#1.base_226| v_ArrVal_2348) |c_~#pre~0.base| v_ArrVal_2349) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_226|))))) is different from false [2022-11-03 02:11:03,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2344 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_2348 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_226| (_ BitVec 32)) (v_ArrVal_2338 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2349 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2338))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2344) |v_ULTIMATE.start_main_~#worker~0#1.base_226| v_ArrVal_2348) |c_~#pre~0.base| v_ArrVal_2349) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_226|))))) is different from false [2022-11-03 02:11:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:03,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:11:03,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40658895] [2022-11-03 02:11:03,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40658895] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:03,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [801408329] [2022-11-03 02:11:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:03,493 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:11:03,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:11:03,495 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:11:03,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-11-03 02:11:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:05,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-03 02:11:05,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:05,739 INFO L356 Elim1Store]: treesize reduction 226, result has 19.0 percent of original size [2022-11-03 02:11:05,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 91 [2022-11-03 02:11:06,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:11:06,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:11:06,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:11:07,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2022-11-03 02:11:07,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 44 treesize of output 24 [2022-11-03 02:11:07,518 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-11-03 02:11:07,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 49 [2022-11-03 02:11:07,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:11:08,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:11:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:11:08,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:09,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2455))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))))) is different from false [2022-11-03 02:11:09,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2454) |c_~#pre~0.base| v_ArrVal_2455))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))))) is different from false [2022-11-03 02:11:09,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_227| (_ BitVec 32))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2452) |v_ULTIMATE.start_main_~#worker~0#1.base_227| v_ArrVal_2454) |c_~#pre~0.base| v_ArrVal_2455))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_227|))) (= ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))))) is different from false [2022-11-03 02:11:09,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2454 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2451 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2452 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2455 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_227| (_ BitVec 32))) (let ((.cse1 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2444) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2451) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2452) |v_ULTIMATE.start_main_~#worker~0#1.base_227| v_ArrVal_2454) |c_~#pre~0.base| v_ArrVal_2455))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 |c_~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select .cse0 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_227|))) (not (= ((_ extract 7 0) (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))))) is different from false [2022-11-03 02:11:09,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:09,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [801408329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:09,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047757577] [2022-11-03 02:11:09,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:09,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:09,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:09,448 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:09,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-03 02:11:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:09,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:11:09,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:10,043 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:11:10,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 97 [2022-11-03 02:11:10,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:11:10,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:11:10,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 36 [2022-11-03 02:11:10,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2022-11-03 02:11:10,852 INFO L356 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-03 02:11:10,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:11:11,196 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:11:11,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 40 [2022-11-03 02:11:11,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:11:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:11,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:11,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2558) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:11:11,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2557) |c_~#pre~0.base| v_ArrVal_2558) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:11:11,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_228| (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2556) |v_ULTIMATE.start_main_~#worker~0#1.base_228| v_ArrVal_2557) |c_~#pre~0.base| v_ArrVal_2558) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_228|))))) is different from false [2022-11-03 02:11:11,968 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_228| (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2549 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2558 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2549))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2556) |v_ULTIMATE.start_main_~#worker~0#1.base_228| v_ArrVal_2557) |c_~#pre~0.base| v_ArrVal_2558) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_228|))))) is different from false [2022-11-03 02:11:12,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:12,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047757577] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:12,009 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:11:12,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 8, 7, 6, 6] total 36 [2022-11-03 02:11:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332236495] [2022-11-03 02:11:12,010 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:12,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 02:11:12,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:11:12,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 02:11:12,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=559, Unknown=12, NotChecked=708, Total=1406 [2022-11-03 02:11:12,012 INFO L87 Difference]: Start difference. First operand 3716 states and 8336 transitions. Second operand has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:25,863 WARN L234 SmtUtils]: Spent 6.53s on a formula simplification. DAG size of input: 192 DAG size of output: 102 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:11:47,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:47,841 INFO L93 Difference]: Finished difference Result 3967 states and 8749 transitions. [2022-11-03 02:11:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:11:47,842 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:11:47,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:47,848 INFO L225 Difference]: With dead ends: 3967 [2022-11-03 02:11:47,848 INFO L226 Difference]: Without dead ends: 3967 [2022-11-03 02:11:47,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=219, Invalid=1149, Unknown=12, NotChecked=972, Total=2352 [2022-11-03 02:11:47,849 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 186 mSDsluCounter, 1611 mSDsCounter, 0 mSdLazyCounter, 3524 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 8641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5109 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:47,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 229 Invalid, 8641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3524 Invalid, 0 Unknown, 5109 Unchecked, 20.0s Time] [2022-11-03 02:11:47,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3967 states. [2022-11-03 02:11:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3967 to 3720. [2022-11-03 02:11:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3720 states, 3512 states have (on average 2.375854214123007) internal successors, (8344), 3719 states have internal predecessors, (8344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 8344 transitions. [2022-11-03 02:11:47,938 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 8344 transitions. Word has length 12 [2022-11-03 02:11:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:47,938 INFO L495 AbstractCegarLoop]: Abstraction has 3720 states and 8344 transitions. [2022-11-03 02:11:47,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 8344 transitions. [2022-11-03 02:11:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:11:47,940 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:47,940 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:47,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:48,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:48,362 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:48,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:11:48,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:11:48,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:48,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1339824106, now seen corresponding path program 1 times [2022-11-03 02:11:48,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:11:48,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595515972] [2022-11-03 02:11:48,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:11:48,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:11:48,552 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:11:48,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-11-03 02:11:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:49,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:11:49,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:49,325 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:11:49,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:11:49,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:49,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:49,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:11:49,966 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:11:49,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:11:50,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:50,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:50,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:50,418 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2656) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:11:50,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2655) |c_~#pre~0.base| v_ArrVal_2656) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:11:50,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_229| (_ BitVec 32)) (v_ArrVal_2655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2654 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2654) |v_ULTIMATE.start_main_~#worker~0#1.base_229| v_ArrVal_2655) |c_~#pre~0.base| v_ArrVal_2656) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_229|) (_ bv0 1))))) is different from false [2022-11-03 02:11:50,528 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_229| (_ BitVec 32)) (v_ArrVal_2652 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2653 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2654 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_229|) (_ bv0 1))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2652) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2653) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2654) |v_ULTIMATE.start_main_~#worker~0#1.base_229| v_ArrVal_2655) |c_~#pre~0.base| v_ArrVal_2656) |c_~#post~0.base|) |c_~#post~0.offset|))))) is different from false [2022-11-03 02:11:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:50,574 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:11:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595515972] [2022-11-03 02:11:50,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595515972] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:50,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1658224201] [2022-11-03 02:11:50,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:11:50,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:11:50,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:11:50,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-11-03 02:11:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:51,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:11:51,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:52,164 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:11:52,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 72 treesize of output 101 [2022-11-03 02:11:52,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:52,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:52,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:11:52,655 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:11:52,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:11:52,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:52,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:52,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:53,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2754))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|))))))) is different from false [2022-11-03 02:11:53,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_2753 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2753) |c_~#pre~0.base| v_ArrVal_2754))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)))))) is different from false [2022-11-03 02:11:53,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2751 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_230| (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2753 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2751) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2752) |v_ULTIMATE.start_main_~#worker~0#1.base_230| v_ArrVal_2753) |c_~#pre~0.base| v_ArrVal_2754))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_230|) (_ bv0 1))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))) is different from false [2022-11-03 02:11:53,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2751 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_230| (_ BitVec 32)) (v_ArrVal_2754 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_2752 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2753 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_2748 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2748) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2751) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2752) |v_ULTIMATE.start_main_~#worker~0#1.base_230| v_ArrVal_2753) |c_~#pre~0.base| v_ArrVal_2754))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_230|) (_ bv0 1)))))) is different from false [2022-11-03 02:11:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:53,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1658224201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:53,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537652785] [2022-11-03 02:11:53,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:53,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:11:53,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:11:53,299 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:11:53,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-03 02:11:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:53,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:11:53,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:54,054 INFO L356 Elim1Store]: treesize reduction 140, result has 25.1 percent of original size [2022-11-03 02:11:54,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 132 treesize of output 163 [2022-11-03 02:11:54,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:54,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:54,503 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:11:54,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:11:54,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:11:54,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:54,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:11:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:11:54,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:11:54,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2852) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:11:54,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2851) |c_~#pre~0.base| v_ArrVal_2852) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:11:54,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_231| (_ BitVec 32)) (v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~#worker~0#1.base_231| v_ArrVal_2851) |c_~#pre~0.base| v_ArrVal_2852) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_231|) (_ bv0 1))))) is different from false [2022-11-03 02:11:54,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2848 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2849 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2850 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_231| (_ BitVec 32)) (v_ArrVal_2851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2852 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2848) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_2850) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2849) |v_ULTIMATE.start_main_~#worker~0#1.base_231| v_ArrVal_2851) |c_~#pre~0.base| v_ArrVal_2852) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_231|) (_ bv0 1))))) is different from false [2022-11-03 02:11:54,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:11:54,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537652785] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:11:54,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:11:54,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6, 5, 5] total 22 [2022-11-03 02:11:54,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509761170] [2022-11-03 02:11:54,906 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:11:54,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-03 02:11:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:11:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-03 02:11:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=107, Unknown=12, NotChecked=372, Total=552 [2022-11-03 02:11:54,908 INFO L87 Difference]: Start difference. First operand 3720 states and 8344 transitions. Second operand has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:11:58,258 INFO L93 Difference]: Finished difference Result 3752 states and 8412 transitions. [2022-11-03 02:11:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:11:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:11:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:11:58,268 INFO L225 Difference]: With dead ends: 3752 [2022-11-03 02:11:58,268 INFO L226 Difference]: Without dead ends: 3752 [2022-11-03 02:11:58,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=83, Invalid=135, Unknown=12, NotChecked=420, Total=650 [2022-11-03 02:11:58,269 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 76 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2298 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:11:58,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 54 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 418 Invalid, 0 Unknown, 2298 Unchecked, 2.8s Time] [2022-11-03 02:11:58,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2022-11-03 02:11:58,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3752. [2022-11-03 02:11:58,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3752 states, 3544 states have (on average 2.373589164785553) internal successors, (8412), 3751 states have internal predecessors, (8412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3752 states to 3752 states and 8412 transitions. [2022-11-03 02:11:58,362 INFO L78 Accepts]: Start accepts. Automaton has 3752 states and 8412 transitions. Word has length 12 [2022-11-03 02:11:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:11:58,362 INFO L495 AbstractCegarLoop]: Abstraction has 3752 states and 8412 transitions. [2022-11-03 02:11:58,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.260869565217391) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:11:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 3752 states and 8412 transitions. [2022-11-03 02:11:58,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:11:58,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:11:58,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:11:58,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:58,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:58,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-11-03 02:11:58,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:11:58,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:11:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:11:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -862484575, now seen corresponding path program 1 times [2022-11-03 02:11:58,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:11:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969727870] [2022-11-03 02:11:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:11:58,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:11:58,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:11:58,980 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:11:58,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-11-03 02:11:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:11:59,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-03 02:11:59,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:11:59,707 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:11:59,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:00,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:00,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:00,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:00,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2022-11-03 02:12:00,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:12:00,588 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:12:00,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:12:00,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:12:01,100 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:12:01,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 02:12:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:01,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:01,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_2957) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:01,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_2956) |c_~#pre~0.base| v_ArrVal_2957) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:01,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#worker~0#1.base_232| (_ BitVec 32)) (v_ArrVal_2956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_232|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2954) |v_ULTIMATE.start_main_~#worker~0#1.base_232| v_ArrVal_2956) |c_~#pre~0.base| v_ArrVal_2957) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2022-11-03 02:12:01,720 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2948 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#worker~0#1.base_232| (_ BitVec 32)) (v_ArrVal_2956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2954 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_232|))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_2948))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_2954) |v_ULTIMATE.start_main_~#worker~0#1.base_232| v_ArrVal_2956) |c_~#pre~0.base| v_ArrVal_2957) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32))))))) is different from false [2022-11-03 02:12:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:12:01,763 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:12:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969727870] [2022-11-03 02:12:01,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969727870] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1000790548] [2022-11-03 02:12:01,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:01,763 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:01,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:12:01,764 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:12:01,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-11-03 02:12:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:02,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:12:02,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:03,138 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:12:03,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 89 [2022-11-03 02:12:03,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:03,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:03,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 24 [2022-11-03 02:12:03,719 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:12:03,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:12:03,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:04,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:04,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:04,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3055))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:12:04,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3054) |c_~#pre~0.base| v_ArrVal_3055))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))))))) is different from false [2022-11-03 02:12:04,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_233| (_ BitVec 32)) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3052) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3053) |v_ULTIMATE.start_main_~#worker~0#1.base_233| v_ArrVal_3054) |c_~#pre~0.base| v_ArrVal_3055))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_233|))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))))) is different from false [2022-11-03 02:12:04,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3050 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_233| (_ BitVec 32)) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_3053 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3054 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3050) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3052) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3053) |v_ULTIMATE.start_main_~#worker~0#1.base_233| v_ArrVal_3054) |c_~#pre~0.base| v_ArrVal_3055))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_233|))) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))))) is different from false [2022-11-03 02:12:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:12:04,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1000790548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:04,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446016991] [2022-11-03 02:12:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:04,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:04,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:04,844 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:04,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-03 02:12:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:05,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-03 02:12:05,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:05,460 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:05,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:05,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:05,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:06,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-03 02:12:06,283 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:06,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:06,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:06,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:06,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:06,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:06,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3153 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3153) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:06,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3153 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3152) |c_~#pre~0.base| v_ArrVal_3153) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:06,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_234| (_ BitVec 32)) (v_ArrVal_3152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3153 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3150) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3151) |v_ULTIMATE.start_main_~#worker~0#1.base_234| v_ArrVal_3152) |c_~#pre~0.base| v_ArrVal_3153) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_234|))))) is different from false [2022-11-03 02:12:06,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3149 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_234| (_ BitVec 32)) (v_ArrVal_3152 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3151 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3153 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3149) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3150) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3151) |v_ULTIMATE.start_main_~#worker~0#1.base_234| v_ArrVal_3152) |c_~#pre~0.base| v_ArrVal_3153) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_234|))))) is different from false [2022-11-03 02:12:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-03 02:12:06,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446016991] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:06,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:12:06,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 7, 6, 6] total 29 [2022-11-03 02:12:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646984735] [2022-11-03 02:12:06,728 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:06,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-03 02:12:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:12:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-03 02:12:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=286, Unknown=12, NotChecked=540, Total=930 [2022-11-03 02:12:06,730 INFO L87 Difference]: Start difference. First operand 3752 states and 8412 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:10,883 INFO L93 Difference]: Finished difference Result 3765 states and 8438 transitions. [2022-11-03 02:12:10,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:12:10,884 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:12:10,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:10,891 INFO L225 Difference]: With dead ends: 3765 [2022-11-03 02:12:10,891 INFO L226 Difference]: Without dead ends: 3765 [2022-11-03 02:12:10,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 12 IntricatePredicates, 1 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=109, Invalid=347, Unknown=12, NotChecked=588, Total=1056 [2022-11-03 02:12:10,892 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1983 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:10,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 61 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 559 Invalid, 0 Unknown, 1983 Unchecked, 3.4s Time] [2022-11-03 02:12:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3765 states. [2022-11-03 02:12:10,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3765 to 3765. [2022-11-03 02:12:10,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3557 states have (on average 2.3722237840877143) internal successors, (8438), 3764 states have internal predecessors, (8438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 8438 transitions. [2022-11-03 02:12:10,953 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 8438 transitions. Word has length 12 [2022-11-03 02:12:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:10,953 INFO L495 AbstractCegarLoop]: Abstraction has 3765 states and 8438 transitions. [2022-11-03 02:12:10,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 30 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 8438 transitions. [2022-11-03 02:12:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:12:10,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:10,954 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:10,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:11,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:11,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:11,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:12:11,560 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:12:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1879110332, now seen corresponding path program 1 times [2022-11-03 02:12:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:12:11,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262438068] [2022-11-03 02:12:11,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:12:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:12:11,562 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:12:11,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-11-03 02:12:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:11,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:12:11,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:12,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:12,111 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:12:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262438068] [2022-11-03 02:12:12,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262438068] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:12,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1599224083] [2022-11-03 02:12:12,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:12,111 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:12,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:12:12,112 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:12:12,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-11-03 02:12:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:12,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:12:12,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:12,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:12,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:12,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1599224083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:12,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000636311] [2022-11-03 02:12:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:12,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:12,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:12,867 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:12,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-03 02:12:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:13,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:12:13,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:13,280 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:13,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:13,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000636311] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:13,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:12:13,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 5] total 11 [2022-11-03 02:12:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807111574] [2022-11-03 02:12:13,543 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 02:12:13,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:12:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 02:12:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:12:13,544 INFO L87 Difference]: Start difference. First operand 3765 states and 8438 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:16,341 INFO L93 Difference]: Finished difference Result 3690 states and 8271 transitions. [2022-11-03 02:12:16,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:12:16,342 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have 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-03 02:12:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:16,366 INFO L225 Difference]: With dead ends: 3690 [2022-11-03 02:12:16,366 INFO L226 Difference]: Without dead ends: 3690 [2022-11-03 02:12:16,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:12:16,367 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 140 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:16,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 40 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-03 02:12:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2022-11-03 02:12:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3690. [2022-11-03 02:12:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3482 states have (on average 2.375358989086732) internal successors, (8271), 3689 states have internal predecessors, (8271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 8271 transitions. [2022-11-03 02:12:16,437 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 8271 transitions. Word has length 13 [2022-11-03 02:12:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:16,437 INFO L495 AbstractCegarLoop]: Abstraction has 3690 states and 8271 transitions. [2022-11-03 02:12:16,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 8271 transitions. [2022-11-03 02:12:16,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:12:16,438 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:16,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:16,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:16,705 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:16,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:17,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:17,057 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:12:17,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1448032203, now seen corresponding path program 1 times [2022-11-03 02:12:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:12:17,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025661260] [2022-11-03 02:12:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:17,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:12:17,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:12:17,060 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:12:17,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-11-03 02:12:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:17,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-03 02:12:17,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:17,926 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:17,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:18,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:18,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:18,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:12:18,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2022-11-03 02:12:18,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:12:18,655 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:18,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:18,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2022-11-03 02:12:19,231 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:12:19,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 02:12:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:19,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:19,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3544 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3544) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:19,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3544 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3543 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3543) |c_~#pre~0.base| v_ArrVal_3544) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:19,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3544 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_3543 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_238| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_238|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3538) |v_ULTIMATE.start_main_~#worker~0#1.base_238| v_ArrVal_3543) |c_~#pre~0.base| v_ArrVal_3544) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2022-11-03 02:12:19,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3544 (Array (_ BitVec 32) (_ BitVec 32))) (|ULTIMATE.start_main_~#b1~0#1.offset| (_ BitVec 32)) (v_ArrVal_3543 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_238| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_238|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3534))) (store .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#b1~0#1.base|) |ULTIMATE.start_main_~#b1~0#1.offset| (_ bv2 32)) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#b1~0#1.offset|) (_ bv0 32)))) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3538) |v_ULTIMATE.start_main_~#worker~0#1.base_238| v_ArrVal_3543) |c_~#pre~0.base| v_ArrVal_3544) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2022-11-03 02:12:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:19,871 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:12:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025661260] [2022-11-03 02:12:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025661260] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:19,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2037072745] [2022-11-03 02:12:19,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:19,872 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:19,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:12:19,873 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:12:19,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-11-03 02:12:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:21,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 02:12:21,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:21,584 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:12:21,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 75 treesize of output 102 [2022-11-03 02:12:21,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:21,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:22,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 24 [2022-11-03 02:12:22,237 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:12:22,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 13 [2022-11-03 02:12:22,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:22,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:23,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:23,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3644 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3644))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))))))) is different from false [2022-11-03 02:12:23,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3643) |c_~#pre~0.base| v_ArrVal_3644))) (or (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))))) is different from false [2022-11-03 02:12:23,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_239| (_ BitVec 32)) (v_ArrVal_3644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3642) |v_ULTIMATE.start_main_~#worker~0#1.base_239| v_ArrVal_3643) |c_~#pre~0.base| v_ArrVal_3644))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_239|) (_ bv0 1))) (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |c_~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:12:23,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3639 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_239| (_ BitVec 32)) (v_ArrVal_3644 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3643 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_3642 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3641 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3639) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3641) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3642) |v_ULTIMATE.start_main_~#worker~0#1.base_239| v_ArrVal_3643) |c_~#pre~0.base| v_ArrVal_3644))) (or (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_239|) (_ bv0 1))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select .cse0 |~#in~0.base|) |c_~#in~0.offset|))))))) is different from false [2022-11-03 02:12:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:23,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2037072745] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:23,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665243107] [2022-11-03 02:12:23,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:23,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:23,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:23,596 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:23,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-11-03 02:12:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:23,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:12:24,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:24,268 INFO L356 Elim1Store]: treesize reduction 144, result has 23.0 percent of original size [2022-11-03 02:12:24,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 97 [2022-11-03 02:12:24,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:24,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:24,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-03 02:12:25,074 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:25,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:25,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:25,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:25,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:25,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3742) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8))) is different from false [2022-11-03 02:12:25,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3741 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3741) |c_~#pre~0.base| v_ArrVal_3742) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))))) is different from false [2022-11-03 02:12:25,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_240| (_ BitVec 32)) (v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3739 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_240|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3740) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3739) |v_ULTIMATE.start_main_~#worker~0#1.base_240| v_ArrVal_3741) |c_~#pre~0.base| v_ArrVal_3742) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32)))) (_ bv0 8)))) is different from false [2022-11-03 02:12:26,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3738 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_240| (_ BitVec 32)) (v_ArrVal_3742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3739 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_240|))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3738) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3740) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3739) |v_ULTIMATE.start_main_~#worker~0#1.base_240| v_ArrVal_3741) |c_~#pre~0.base| v_ArrVal_3742) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| (_ bv1 32))))))) is different from false [2022-11-03 02:12:26,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:26,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665243107] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:26,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:12:26,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7, 6, 6] total 34 [2022-11-03 02:12:26,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454160126] [2022-11-03 02:12:26,042 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:26,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:12:26,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:12:26,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:12:26,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=477, Unknown=12, NotChecked=660, Total=1260 [2022-11-03 02:12:26,043 INFO L87 Difference]: Start difference. First operand 3690 states and 8271 transitions. Second operand has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:33,497 INFO L93 Difference]: Finished difference Result 3692 states and 8275 transitions. [2022-11-03 02:12:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:12:33,498 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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-03 02:12:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:33,504 INFO L225 Difference]: With dead ends: 3692 [2022-11-03 02:12:33,504 INFO L226 Difference]: Without dead ends: 3692 [2022-11-03 02:12:33,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=151, Invalid=641, Unknown=12, NotChecked=756, Total=1560 [2022-11-03 02:12:33,506 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2341 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:33,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 3303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 956 Invalid, 0 Unknown, 2341 Unchecked, 6.0s Time] [2022-11-03 02:12:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2022-11-03 02:12:33,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3691. [2022-11-03 02:12:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3483 states have (on average 2.3752512202124607) internal successors, (8273), 3690 states have internal predecessors, (8273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 8273 transitions. [2022-11-03 02:12:33,587 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 8273 transitions. Word has length 13 [2022-11-03 02:12:33,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:33,588 INFO L495 AbstractCegarLoop]: Abstraction has 3691 states and 8273 transitions. [2022-11-03 02:12:33,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 8273 transitions. [2022-11-03 02:12:33,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:12:33,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:33,589 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:33,633 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:33,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (41)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:34,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:34,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:12:34,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:12:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1447792728, now seen corresponding path program 1 times [2022-11-03 02:12:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:12:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282841584] [2022-11-03 02:12:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:34,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:12:34,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:12:34,211 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:12:34,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-11-03 02:12:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:34,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:12:34,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:35,025 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:35,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:35,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:35,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:35,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:12:35,669 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:35,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:35,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:35,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:36,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:36,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:36,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3847 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3847) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| |c_ULTIMATE.start_worker_fn_~i~0#1|))))) is different from false [2022-11-03 02:12:36,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3847 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3847) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:12:36,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3847 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3845) |c_~#pre~0.base| v_ArrVal_3847) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:12:36,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3847 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_241| (_ BitVec 32)) (v_ArrVal_3844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3843 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_241|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3843) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3844) |v_ULTIMATE.start_main_~#worker~0#1.base_241| v_ArrVal_3845) |c_~#pre~0.base| v_ArrVal_3847) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:12:36,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3842 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_241| (_ BitVec 32)) (v_ArrVal_3844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3843 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3842) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3843) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3844) |v_ULTIMATE.start_main_~#worker~0#1.base_241| v_ArrVal_3845) |c_~#pre~0.base| v_ArrVal_3847) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_241|) (_ bv0 1))))) is different from false [2022-11-03 02:12:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:36,354 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:12:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282841584] [2022-11-03 02:12:36,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282841584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [792415106] [2022-11-03 02:12:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:36,355 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:36,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:12:36,356 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:12:36,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-11-03 02:12:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:38,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-03 02:12:38,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:38,320 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:38,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:38,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:38,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:38,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-11-03 02:12:38,751 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:38,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:38,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:38,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:39,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:39,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:39,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3952) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| |c_ULTIMATE.start_worker_fn_~i~0#1|))))) is different from false [2022-11-03 02:12:41,233 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3952) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (forall ((v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|~#in~0.offset| (_ BitVec 32))) (not (= (_ bv0 8) ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_3951) |~#in~0.base|) |~#in~0.offset|)))))) is different from false [2022-11-03 02:12:41,307 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_3950))) (or (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3951) |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8))) (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3952) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))) is different from false [2022-11-03 02:12:41,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#worker~0#1.base_242| (_ BitVec 32)) (v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3948) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3949) |v_ULTIMATE.start_main_~#worker~0#1.base_242| v_ArrVal_3950))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_242|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3952) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3951) |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:12:41,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3951 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#worker~0#1.base_242| (_ BitVec 32)) (v_ArrVal_3950 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3949 (Array (_ BitVec 32) (_ BitVec 32))) (|~#in~0.offset| (_ BitVec 32)) (v_ArrVal_3948 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_3946) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_3948) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_3949) |v_ULTIMATE.start_main_~#worker~0#1.base_242| v_ArrVal_3950))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_242|) (_ bv0 1))) (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3952) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)) (not (= ((_ extract 7 0) (select (select (store .cse0 |c_~#pre~0.base| v_ArrVal_3951) |~#in~0.base|) |~#in~0.offset|)) (_ bv0 8)))))) is different from false [2022-11-03 02:12:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:41,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [792415106] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:41,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826057562] [2022-11-03 02:12:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:41,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:41,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:41,461 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:41,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-11-03 02:12:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:41,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-03 02:12:41,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:42,122 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:42,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:42,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:42,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:42,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2022-11-03 02:12:42,938 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-11-03 02:12:42,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 40 [2022-11-03 02:12:42,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:43,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:43,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-11-03 02:12:43,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:43,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:43,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_4057) |c_~#post~0.base|) (bvadd |c_~#post~0.offset| |c_ULTIMATE.start_worker_fn_~i~0#1|))) (_ bv0 8))) is different from false [2022-11-03 02:12:43,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_4057) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:12:43,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4055 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4055) |c_~#pre~0.base| v_ArrVal_4057) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) is different from false [2022-11-03 02:12:43,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_243| (_ BitVec 32)) (v_ArrVal_4054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4055 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_243|))) (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4054) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4053) |v_ULTIMATE.start_main_~#worker~0#1.base_243| v_ArrVal_4055) |c_~#pre~0.base| v_ArrVal_4057) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:12:43,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4052 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4057 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_243| (_ BitVec 32)) (v_ArrVal_4054 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4053 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4055 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_243|))) (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_4052) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4054) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4053) |v_ULTIMATE.start_main_~#worker~0#1.base_243| v_ArrVal_4055) |c_~#pre~0.base| v_ArrVal_4057) |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8)))) is different from false [2022-11-03 02:12:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:43,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826057562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:43,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:12:43,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 7, 6, 6] total 25 [2022-11-03 02:12:43,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668234518] [2022-11-03 02:12:43,421 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:43,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-03 02:12:43,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:12:43,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-03 02:12:43,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=111, Unknown=15, NotChecked=510, Total=702 [2022-11-03 02:12:43,422 INFO L87 Difference]: Start difference. First operand 3691 states and 8273 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:12:47,630 INFO L93 Difference]: Finished difference Result 3705 states and 8302 transitions. [2022-11-03 02:12:47,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:12:47,631 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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-03 02:12:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:12:47,638 INFO L225 Difference]: With dead ends: 3705 [2022-11-03 02:12:47,638 INFO L226 Difference]: Without dead ends: 3705 [2022-11-03 02:12:47,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=83, Invalid=144, Unknown=15, NotChecked=570, Total=812 [2022-11-03 02:12:47,644 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2642 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:12:47,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 63 Invalid, 3083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 423 Invalid, 0 Unknown, 2642 Unchecked, 3.2s Time] [2022-11-03 02:12:47,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2022-11-03 02:12:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3679. [2022-11-03 02:12:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3679 states, 3471 states have (on average 2.376260443676174) internal successors, (8248), 3678 states have internal predecessors, (8248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 8248 transitions. [2022-11-03 02:12:47,805 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 8248 transitions. Word has length 13 [2022-11-03 02:12:47,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:12:47,805 INFO L495 AbstractCegarLoop]: Abstraction has 3679 states and 8248 transitions. [2022-11-03 02:12:47,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:12:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 8248 transitions. [2022-11-03 02:12:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:12:47,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:12:47,807 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:12:47,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:48,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:48,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-11-03 02:12:48,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:12:48,418 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 38 more)] === [2022-11-03 02:12:48,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:12:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1415132743, now seen corresponding path program 1 times [2022-11-03 02:12:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:12:48,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54388270] [2022-11-03 02:12:48,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:48,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:12:48,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:12:48,420 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:12:48,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-11-03 02:12:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:49,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-03 02:12:49,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:49,268 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:49,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:49,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:49,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:49,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 28 treesize of output 30 [2022-11-03 02:12:50,005 INFO L356 Elim1Store]: treesize reduction 18, result has 41.9 percent of original size [2022-11-03 02:12:50,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-11-03 02:12:50,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:50,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-03 02:12:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:50,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:50,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_4157) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:12:50,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4156) |c_~#pre~0.base| v_ArrVal_4157) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:12:50,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_244| (_ BitVec 32)) (v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 8) ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4154) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4155) |v_ULTIMATE.start_main_~#worker~0#1.base_244| v_ArrVal_4156) |c_~#pre~0.base| v_ArrVal_4157) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_244|))))) is different from false [2022-11-03 02:12:50,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#worker~0#1.base_244| (_ BitVec 32)) (v_ArrVal_4157 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4156 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4153 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4155 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4154 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_4153) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4154) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4155) |v_ULTIMATE.start_main_~#worker~0#1.base_244| v_ArrVal_4156) |c_~#pre~0.base| v_ArrVal_4157) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_244|))))) is different from false [2022-11-03 02:12:50,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:50,921 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:12:50,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54388270] [2022-11-03 02:12:50,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54388270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:50,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [201664847] [2022-11-03 02:12:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:50,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:12:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:12:50,922 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:12:50,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (47)] Waiting until timeout for monitored process [2022-11-03 02:12:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:52,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-03 02:12:52,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:52,880 INFO L356 Elim1Store]: treesize reduction 226, result has 19.0 percent of original size [2022-11-03 02:12:52,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 91 [2022-11-03 02:12:53,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:12:53,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:12:54,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2022-11-03 02:12:54,150 INFO L356 Elim1Store]: treesize reduction 30, result has 41.2 percent of original size [2022-11-03 02:12:54,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 49 [2022-11-03 02:12:54,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:12:54,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-03 02:12:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:55,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:55,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_4256))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (= ((_ extract 7 0) (select .cse0 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= ((_ extract 7 0) (select .cse0 |c_~#in~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))))) is different from false [2022-11-03 02:12:55,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4255) |c_~#pre~0.base| v_ArrVal_4256))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (= ((_ extract 7 0) (select .cse0 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= ((_ extract 7 0) (select .cse0 |c_~#in~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))))))) is different from false [2022-11-03 02:12:55,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_245| (_ BitVec 32)) (v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4254) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4253) |v_ULTIMATE.start_main_~#worker~0#1.base_245| v_ArrVal_4255) |c_~#pre~0.base| v_ArrVal_4256))) (let ((.cse0 (select .cse1 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select .cse0 |c_~#in~0.offset|)) (_ bv0 8))) (not (= ((_ extract 7 0) (select (select .cse1 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_245|) (_ bv0 1))) (= ((_ extract 7 0) (select .cse0 (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)))))) is different from false [2022-11-03 02:12:55,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4256 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_245| (_ BitVec 32)) (v_ArrVal_4255 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4254 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4253 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_4250) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4254) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4253) |v_ULTIMATE.start_main_~#worker~0#1.base_245| v_ArrVal_4255) |c_~#pre~0.base| v_ArrVal_4256))) (let ((.cse1 (select .cse0 |c_~#in~0.base|))) (or (not (= ((_ extract 7 0) (select (select .cse0 |c_~#post~0.base|) |c_~#post~0.offset|)) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (select .cse1 (bvadd (_ bv1 32) |c_~#in~0.offset|)))) (not (= ((_ extract 7 0) (select .cse1 |c_~#in~0.offset|)) (_ bv0 8))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_245|) (_ bv0 1))))))) is different from false [2022-11-03 02:12:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:55,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [201664847] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:55,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344153874] [2022-11-03 02:12:55,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:12:55,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:12:55,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:12:55,972 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:12:55,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a798ad7-af96-4c8c-962c-302f208c8c43/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-11-03 02:12:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:12:56,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-03 02:12:56,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:12:56,652 INFO L356 Elim1Store]: treesize reduction 153, result has 18.2 percent of original size [2022-11-03 02:12:56,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 47 treesize of output 67 [2022-11-03 02:12:57,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:57,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:57,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2022-11-03 02:12:57,484 INFO L356 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-03 02:12:57,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-11-03 02:12:57,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:57,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 19 [2022-11-03 02:12:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:12:58,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:12:58,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_4354) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:12:58,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32)))) (= ((_ extract 7 0) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_4353) |c_~#pre~0.base| v_ArrVal_4354) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8))) is different from false [2022-11-03 02:12:58,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4351 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_246| (_ BitVec 32)) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4352 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4351) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4352) |v_ULTIMATE.start_main_~#worker~0#1.base_246| v_ArrVal_4353) |c_~#pre~0.base| v_ArrVal_4354) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_246|))))) is different from false [2022-11-03 02:12:58,414 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4354 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4351 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#worker~0#1.base_246| (_ BitVec 32)) (v_ArrVal_4353 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4352 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= ((_ extract 7 0) (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base| v_ArrVal_4349) |c_ULTIMATE.start_main_~#b1~0#1.base| v_ArrVal_4351) |c_ULTIMATE.start_main_~#b2~0#1.base| v_ArrVal_4352) |v_ULTIMATE.start_main_~#worker~0#1.base_246| v_ArrVal_4353) |c_~#pre~0.base| v_ArrVal_4354) |c_~#in~0.base|) (bvadd (_ bv1 32) |c_~#in~0.offset|))) (_ bv0 8)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#worker~0#1.base_246|))))) is different from false [2022-11-03 02:12:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-03 02:12:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344153874] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:12:58,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:12:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7, 6, 6] total 35 [2022-11-03 02:12:58,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279781266] [2022-11-03 02:12:58,441 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:12:58,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-03 02:12:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:12:58,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-03 02:12:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=514, Unknown=12, NotChecked=684, Total=1332 [2022-11-03 02:12:58,443 INFO L87 Difference]: Start difference. First operand 3679 states and 8248 transitions. Second operand has 37 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 36 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:13:03,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-03 02:13:05,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []