./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-divine/one_time_barrier_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_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/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_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/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_2490aeca-6c46-4341-9c7e-a5c29160b59f/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 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d --- 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:29:51,493 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:29:51,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:29:51,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:29:51,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:29:51,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:29:51,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:29:51,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:29:51,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:29:51,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:29:51,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:29:51,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:29:51,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:29:51,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:29:51,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:29:51,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:29:51,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:29:51,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:29:51,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:29:51,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:29:51,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:29:51,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:29:51,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:29:51,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:29:51,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:29:51,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:29:51,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:29:51,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:29:51,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:29:51,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:29:51,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:29:51,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:29:51,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:29:51,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:29:51,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:29:51,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:29:51,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:29:51,564 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:29:51,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:29:51,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:29:51,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:29:51,567 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:29:51,592 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:29:51,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:29:51,593 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:29:51,593 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:29:51,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:29:51,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:29:51,595 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:29:51,595 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:29:51,595 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:29:51,596 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:29:51,596 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:29:51,596 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:29:51,596 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:29:51,597 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:29:51,597 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:29:51,597 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:29:51,598 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:29:51,598 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:29:51,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:29:51,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:29:51,599 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:29:51,599 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:29:51,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:29:51,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:29:51,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:29:51,601 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:29:51,601 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:29:51,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:29:51,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:29:51,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:29:51,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:29:51,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:29:51,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:29:51,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:29:51,603 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:29:51,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:29:51,604 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:29:51,604 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:29:51,604 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:29:51,605 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:29:51,605 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:29:51,605 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/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_2490aeca-6c46-4341-9c7e-a5c29160b59f/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 -> 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d [2022-11-03 02:29:51,835 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:29:51,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:29:51,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:29:51,875 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:29:51,875 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:29:51,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-11-03 02:29:51,954 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/data/8cc168efd/24211c5896c44afcaea32a43d58efdc1/FLAGebc0ada0b [2022-11-03 02:29:52,482 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:29:52,482 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i [2022-11-03 02:29:52,499 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/data/8cc168efd/24211c5896c44afcaea32a43d58efdc1/FLAGebc0ada0b [2022-11-03 02:29:52,754 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/data/8cc168efd/24211c5896c44afcaea32a43d58efdc1 [2022-11-03 02:29:52,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:29:52,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:29:52,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:29:52,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:29:52,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:29:52,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:29:52" (1/1) ... [2022-11-03 02:29:52,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1049aa52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:52, skipping insertion in model container [2022-11-03 02:29:52,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:29:52" (1/1) ... [2022-11-03 02:29:52,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:29:52,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:29:53,014 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:29:53,225 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-11-03 02:29:53,236 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-11-03 02:29:53,251 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-11-03 02:29:53,252 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-11-03 02:29:53,256 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-11-03 02:29:53,259 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-11-03 02:29:53,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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-11-03 02:29:53,268 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-11-03 02:29:53,270 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-11-03 02:29:53,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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-11-03 02:29:53,273 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-11-03 02:29:53,277 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-11-03 02:29:53,297 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-11-03 02:29:53,298 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-11-03 02:29:53,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:29:53,314 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:29:53,338 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:29:53,364 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-11-03 02:29:53,379 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-11-03 02:29:53,390 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-11-03 02:29:53,391 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-11-03 02:29:53,393 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-11-03 02:29:53,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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-11-03 02:29:53,397 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-11-03 02:29:53,398 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-11-03 02:29:53,400 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-11-03 02:29:53,400 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-11-03 02:29:53,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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-11-03 02:29:53,403 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-11-03 02:29:53,409 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-11-03 02:29:53,415 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_2490aeca-6c46-4341-9c7e-a5c29160b59f/sv-benchmarks/c/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-11-03 02:29:53,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:29:53,460 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:29:53,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53 WrapperNode [2022-11-03 02:29:53,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:29:53,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:29:53,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:29:53,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:29:53,470 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:29:53" (1/1) ... [2022-11-03 02:29:53,485 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:29:53" (1/1) ... [2022-11-03 02:29:53,544 INFO L138 Inliner]: procedures = 174, calls = 70, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 459 [2022-11-03 02:29:53,545 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:29:53,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:29:53,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:29:53,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:29:53,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:29:53,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:29:53,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:29:53,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:29:53,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (1/1) ... [2022-11-03 02:29:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:29:53,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:29:53,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:29:53,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:29:53,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:29:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:29:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-03 02:29:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-11-03 02:29:53,696 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-11-03 02:29:53,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:29:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:29:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:29:53,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:29:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:29:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:29:53,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:29:53,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:29:53,701 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:29:53,999 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:29:54,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:29:54,755 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:29:54,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:29:54,766 INFO L300 CfgBuilder]: Removed 16 assume(true) statements. [2022-11-03 02:29:54,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:29:54 BoogieIcfgContainer [2022-11-03 02:29:54,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:29:54,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:29:54,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:29:54,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:29:54,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:29:52" (1/3) ... [2022-11-03 02:29:54,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37144ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:29:54, skipping insertion in model container [2022-11-03 02:29:54,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:29:53" (2/3) ... [2022-11-03 02:29:54,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37144ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:29:54, skipping insertion in model container [2022-11-03 02:29:54,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:29:54" (3/3) ... [2022-11-03 02:29:54,777 INFO L112 eAbstractionObserver]: Analyzing ICFG one_time_barrier_2t.i [2022-11-03 02:29:54,786 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:29:54,796 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:29:54,796 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-03 02:29:54,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:29:54,889 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-03 02:29:54,928 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:29:54,942 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 468 places, 527 transitions, 1062 flow [2022-11-03 02:29:54,945 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 468 places, 527 transitions, 1062 flow [2022-11-03 02:29:54,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 468 places, 527 transitions, 1062 flow [2022-11-03 02:29:55,241 INFO L130 PetriNetUnfolder]: 94/778 cut-off events. [2022-11-03 02:29:55,241 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-11-03 02:29:55,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 778 events. 94/778 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2638 event pairs, 0 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 460. Up to 4 conditions per place. [2022-11-03 02:29:55,349 INFO L118 LiptonReduction]: Number of co-enabled transitions 104856 [2022-11-03 02:31:07,472 INFO L133 LiptonReduction]: Checked pairs total: 233837 [2022-11-03 02:31:07,473 INFO L135 LiptonReduction]: Total number of compositions: 556 [2022-11-03 02:31:07,482 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 129 places, 158 transitions, 324 flow [2022-11-03 02:31:07,609 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3836 states, 3600 states have (on average 2.5975) internal successors, (9351), 3835 states have internal predecessors, (9351), 0 states have call successors, (0), 0 states 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:31:07,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:31:07,635 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;@619e9976, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:31:07,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2022-11-03 02:31:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 3836 states, 3600 states have (on average 2.5975) internal successors, (9351), 3835 states have internal predecessors, (9351), 0 states have call successors, (0), 0 states 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:31:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:31:07,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:07,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:31:07,652 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:07,657 INFO L85 PathProgramCache]: Analyzing trace with hash 67353, now seen corresponding path program 1 times [2022-11-03 02:31:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:07,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630075169] [2022-11-03 02:31:07,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:31:07,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630075169] [2022-11-03 02:31:07,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630075169] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:07,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:07,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:31:07,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313143705] [2022-11-03 02:31:07,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:07,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:31:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:31:07,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:31:07,884 INFO L87 Difference]: Start difference. First operand has 3836 states, 3600 states have (on average 2.5975) internal successors, (9351), 3835 states have internal predecessors, (9351), 0 states have call successors, (0), 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:31:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:08,272 INFO L93 Difference]: Finished difference Result 3835 states and 8535 transitions. [2022-11-03 02:31:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:31:08,274 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:31:08,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:08,309 INFO L225 Difference]: With dead ends: 3835 [2022-11-03 02:31:08,309 INFO L226 Difference]: Without dead ends: 3833 [2022-11-03 02:31:08,310 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:31:08,313 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 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.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:08,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:31:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2022-11-03 02:31:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 3833. [2022-11-03 02:31:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 3600 states have (on average 2.37) internal successors, (8532), 3832 states have internal predecessors, (8532), 0 states have call successors, (0), 0 states 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:31:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 8532 transitions. [2022-11-03 02:31:08,501 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 8532 transitions. Word has length 2 [2022-11-03 02:31:08,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:08,501 INFO L495 AbstractCegarLoop]: Abstraction has 3833 states and 8532 transitions. [2022-11-03 02:31:08,502 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:31:08,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 8532 transitions. [2022-11-03 02:31:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:31:08,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:08,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:31:08,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:31:08,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:08,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:08,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2011400201, now seen corresponding path program 1 times [2022-11-03 02:31:08,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:08,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674479092] [2022-11-03 02:31:08,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:08,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:08,667 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:31:08,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:08,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674479092] [2022-11-03 02:31:08,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674479092] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:08,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:08,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:31:08,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375451575] [2022-11-03 02:31:08,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:08,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:08,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:08,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:31:08,673 INFO L87 Difference]: Start difference. First operand 3833 states and 8532 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:31:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:09,037 INFO L93 Difference]: Finished difference Result 3834 states and 8533 transitions. [2022-11-03 02:31:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:09,037 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:31:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:09,058 INFO L225 Difference]: With dead ends: 3834 [2022-11-03 02:31:09,058 INFO L226 Difference]: Without dead ends: 3834 [2022-11-03 02:31:09,059 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:31:09,060 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 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.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:09,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:31:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3834 states. [2022-11-03 02:31:09,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3834 to 3834. [2022-11-03 02:31:09,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3834 states, 3601 states have (on average 2.3696195501249653) internal successors, (8533), 3833 states have internal predecessors, (8533), 0 states have call successors, (0), 0 states 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:31:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3834 states to 3834 states and 8533 transitions. [2022-11-03 02:31:09,235 INFO L78 Accepts]: Start accepts. Automaton has 3834 states and 8533 transitions. Word has length 5 [2022-11-03 02:31:09,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:09,235 INFO L495 AbstractCegarLoop]: Abstraction has 3834 states and 8533 transitions. [2022-11-03 02:31:09,236 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:31:09,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3834 states and 8533 transitions. [2022-11-03 02:31:09,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-03 02:31:09,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:09,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-03 02:31:09,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:31:09,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2102570334, now seen corresponding path program 1 times [2022-11-03 02:31:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019294081] [2022-11-03 02:31:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:09,399 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:31:09,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:09,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019294081] [2022-11-03 02:31:09,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019294081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:09,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321021502] [2022-11-03 02:31:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:09,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:09,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:09,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:09,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:31:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:09,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:31:09,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:09,581 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:31:09,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:31:09,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321021502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:09,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:31:09,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-11-03 02:31:09,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329097266] [2022-11-03 02:31:09,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:09,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:31:09,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:09,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:31:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:09,584 INFO L87 Difference]: Start difference. First operand 3834 states and 8533 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:31:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:09,935 INFO L93 Difference]: Finished difference Result 3780 states and 8470 transitions. [2022-11-03 02:31:09,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:31:09,935 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:31:09,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:09,954 INFO L225 Difference]: With dead ends: 3780 [2022-11-03 02:31:09,954 INFO L226 Difference]: Without dead ends: 3780 [2022-11-03 02:31:09,954 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:31:09,956 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 23 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.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:09,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 23 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:31:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2022-11-03 02:31:10,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3780. [2022-11-03 02:31:10,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3559 states have (on average 2.3798819893228433) internal successors, (8470), 3779 states have internal predecessors, (8470), 0 states have call successors, (0), 0 states 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:31:10,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 8470 transitions. [2022-11-03 02:31:10,102 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 8470 transitions. Word has length 6 [2022-11-03 02:31:10,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:10,103 INFO L495 AbstractCegarLoop]: Abstraction has 3780 states and 8470 transitions. [2022-11-03 02:31:10,103 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:31:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 8470 transitions. [2022-11-03 02:31:10,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 02:31:10,104 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:10,104 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:10,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:10,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:10,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:10,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2027701756, now seen corresponding path program 1 times [2022-11-03 02:31:10,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:10,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063446693] [2022-11-03 02:31:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:10,459 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:31:10,464 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:10,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063446693] [2022-11-03 02:31:10,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063446693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:10,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515497489] [2022-11-03 02:31:10,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:10,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:10,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:10,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:10,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:31:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:10,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:31:10,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:10,635 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:31:10,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:10,662 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:31:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515497489] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:10,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [224071088] [2022-11-03 02:31:10,670 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:31:10,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:10,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-11-03 02:31:10,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128890849] [2022-11-03 02:31:10,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:10,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:31:10,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:10,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:31:10,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:10,679 INFO L87 Difference]: Start difference. First operand 3780 states and 8470 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:31:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:11,049 INFO L93 Difference]: Finished difference Result 3781 states and 8471 transitions. [2022-11-03 02:31:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:31:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have 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:31:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:11,067 INFO L225 Difference]: With dead ends: 3781 [2022-11-03 02:31:11,067 INFO L226 Difference]: Without dead ends: 3781 [2022-11-03 02:31:11,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:11,069 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:11,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:31:11,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2022-11-03 02:31:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3781. [2022-11-03 02:31:11,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3781 states, 3560 states have (on average 2.379494382022472) internal successors, (8471), 3780 states have internal predecessors, (8471), 0 states have call successors, (0), 0 states 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:31:11,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 8471 transitions. [2022-11-03 02:31:11,191 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 8471 transitions. Word has length 8 [2022-11-03 02:31:11,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:11,191 INFO L495 AbstractCegarLoop]: Abstraction has 3781 states and 8471 transitions. [2022-11-03 02:31:11,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states 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:31:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 8471 transitions. [2022-11-03 02:31:11,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:31:11,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:11,192 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-11-03 02:31:11,233 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:11,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:11,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:11,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:11,419 INFO L85 PathProgramCache]: Analyzing trace with hash -137151285, now seen corresponding path program 2 times [2022-11-03 02:31:11,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:11,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362529670] [2022-11-03 02:31:11,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:11,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:11,499 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:31:11,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362529670] [2022-11-03 02:31:11,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362529670] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:11,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063841422] [2022-11-03 02:31:11,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:31:11,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:11,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:11,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:11,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:31:11,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:31:11,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:31:11,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:31:11,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:11,707 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:31:11,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:31:11,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063841422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:11,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:31:11,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 02:31:11,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761622291] [2022-11-03 02:31:11,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:11,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:31:11,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:11,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:31:11,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:31:11,709 INFO L87 Difference]: Start difference. First operand 3781 states and 8471 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:31:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:12,092 INFO L93 Difference]: Finished difference Result 3665 states and 8225 transitions. [2022-11-03 02:31:12,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:31:12,093 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:31:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:12,112 INFO L225 Difference]: With dead ends: 3665 [2022-11-03 02:31:12,112 INFO L226 Difference]: Without dead ends: 3665 [2022-11-03 02:31:12,112 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:31:12,113 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 202 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:12,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 23 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:31:12,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2022-11-03 02:31:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3665. [2022-11-03 02:31:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3665 states, 3457 states have (on average 2.3792305467168067) internal successors, (8225), 3664 states have internal predecessors, (8225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:31:12,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 8225 transitions. [2022-11-03 02:31:12,209 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 8225 transitions. Word has length 9 [2022-11-03 02:31:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:12,210 INFO L495 AbstractCegarLoop]: Abstraction has 3665 states and 8225 transitions. [2022-11-03 02:31:12,210 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:31:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 8225 transitions. [2022-11-03 02:31:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-03 02:31:12,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:12,210 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:12,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:12,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:12,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash -137176596, now seen corresponding path program 1 times [2022-11-03 02:31:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:12,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298154124] [2022-11-03 02:31:12,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:13,415 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:31:13,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:13,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298154124] [2022-11-03 02:31:13,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298154124] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:13,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:13,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:31:13,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262581397] [2022-11-03 02:31:13,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:13,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:31:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:13,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:31:13,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:31:13,418 INFO L87 Difference]: Start difference. First operand 3665 states and 8225 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:31:14,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:14,169 INFO L93 Difference]: Finished difference Result 3717 states and 8333 transitions. [2022-11-03 02:31:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:31:14,170 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:31:14,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:14,182 INFO L225 Difference]: With dead ends: 3717 [2022-11-03 02:31:14,183 INFO L226 Difference]: Without dead ends: 3717 [2022-11-03 02:31:14,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:31:14,184 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:14,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 18 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:31:14,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3717 states. [2022-11-03 02:31:14,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3717 to 3678. [2022-11-03 02:31:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3470 states have (on average 2.3780979827089337) internal successors, (8252), 3677 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states 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:31:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 8252 transitions. [2022-11-03 02:31:14,271 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 8252 transitions. Word has length 9 [2022-11-03 02:31:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:14,271 INFO L495 AbstractCegarLoop]: Abstraction has 3678 states and 8252 transitions. [2022-11-03 02:31:14,271 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:31:14,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 8252 transitions. [2022-11-03 02:31:14,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:31:14,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:14,272 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:14,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:31:14,272 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash 43375497, now seen corresponding path program 1 times [2022-11-03 02:31:14,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481530019] [2022-11-03 02:31:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:14,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:14,913 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:31:14,913 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481530019] [2022-11-03 02:31:14,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481530019] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:14,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427871905] [2022-11-03 02:31:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:14,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:14,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:31:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:15,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:31:15,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:15,273 INFO L356 Elim1Store]: treesize reduction 136, result has 24.9 percent of original size [2022-11-03 02:31:15,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 39 treesize of output 69 [2022-11-03 02:31:15,473 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 14 treesize of output 16 [2022-11-03 02:31:15,536 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 14 treesize of output 16 [2022-11-03 02:31:15,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, 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:31:15,673 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-11-03 02:31:15,674 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:31:15,733 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:31:15,803 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:31:15,821 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:31:15,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:15,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_516) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-11-03 02:31:15,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_515 (Array Int Int)) (v_ArrVal_516 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_515) |c_~#pre~0.base| v_ArrVal_516) |c_~#in~0.base|) |c_~#in~0.offset|) 256) 0)) is different from false [2022-11-03 02:31:16,014 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:31:16,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427871905] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [425803989] [2022-11-03 02:31:16,015 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:31:16,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:16,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2022-11-03 02:31:16,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205864386] [2022-11-03 02:31:16,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:16,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-03 02:31:16,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:16,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-03 02:31:16,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=161, Unknown=3, NotChecked=54, Total=272 [2022-11-03 02:31:16,019 INFO L87 Difference]: Start difference. First operand 3678 states and 8252 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:31:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:17,176 INFO L93 Difference]: Finished difference Result 3810 states and 8531 transitions. [2022-11-03 02:31:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:31:17,177 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:31:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:17,189 INFO L225 Difference]: With dead ends: 3810 [2022-11-03 02:31:17,189 INFO L226 Difference]: Without dead ends: 3810 [2022-11-03 02:31:17,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=229, Unknown=3, NotChecked=66, Total=380 [2022-11-03 02:31:17,190 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 163 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 820 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:17,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 32 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 934 Invalid, 0 Unknown, 820 Unchecked, 0.9s Time] [2022-11-03 02:31:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2022-11-03 02:31:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3692. [2022-11-03 02:31:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3484 states have (on average 2.376865671641791) internal successors, (8281), 3691 states have internal predecessors, (8281), 0 states have call successors, (0), 0 states 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:31:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 8281 transitions. [2022-11-03 02:31:17,284 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 8281 transitions. Word has length 10 [2022-11-03 02:31:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:17,284 INFO L495 AbstractCegarLoop]: Abstraction has 3692 states and 8281 transitions. [2022-11-03 02:31:17,284 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:31:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 8281 transitions. [2022-11-03 02:31:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:31:17,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:17,285 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:17,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:17,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:17,510 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1344648539, now seen corresponding path program 1 times [2022-11-03 02:31:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:17,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353574566] [2022-11-03 02:31:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:18,180 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:31:18,180 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:18,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353574566] [2022-11-03 02:31:18,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353574566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:18,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566112652] [2022-11-03 02:31:18,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:18,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:18,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:18,182 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:18,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:31:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:18,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 02:31:18,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:18,457 INFO L356 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-03 02:31:18,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 34 treesize of output 53 [2022-11-03 02:31:18,548 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 21 treesize of output 26 [2022-11-03 02:31:18,636 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 21 treesize of output 26 [2022-11-03 02:31:18,704 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:31:18,726 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-03 02:31:18,726 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 21 treesize of output 25 [2022-11-03 02:31:18,797 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:31:18,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:18,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:18,922 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:31:18,994 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:31:18,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:19,311 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:31:19,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566112652] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:19,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1532464554] [2022-11-03 02:31:19,312 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:31:19,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:19,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2022-11-03 02:31:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661129454] [2022-11-03 02:31:19,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:19,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-03 02:31:19,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-03 02:31:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=258, Unknown=9, NotChecked=0, Total=342 [2022-11-03 02:31:19,314 INFO L87 Difference]: Start difference. First operand 3692 states and 8281 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:31:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:20,947 INFO L93 Difference]: Finished difference Result 3751 states and 8361 transitions. [2022-11-03 02:31:20,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:31:20,948 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:31:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:20,959 INFO L225 Difference]: With dead ends: 3751 [2022-11-03 02:31:20,960 INFO L226 Difference]: Without dead ends: 3751 [2022-11-03 02:31:20,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=327, Unknown=9, NotChecked=0, Total=462 [2022-11-03 02:31:20,961 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 257 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 663 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:20,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 41 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1377 Invalid, 0 Unknown, 663 Unchecked, 1.3s Time] [2022-11-03 02:31:20,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-11-03 02:31:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 3706. [2022-11-03 02:31:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3498 states have (on average 2.3756432246998287) internal successors, (8310), 3705 states have internal predecessors, (8310), 0 states have call successors, (0), 0 states 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:31:21,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 8310 transitions. [2022-11-03 02:31:21,053 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 8310 transitions. Word has length 11 [2022-11-03 02:31:21,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:21,053 INFO L495 AbstractCegarLoop]: Abstraction has 3706 states and 8310 transitions. [2022-11-03 02:31:21,054 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:31:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 8310 transitions. [2022-11-03 02:31:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 02:31:21,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:21,055 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:21,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:21,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:21,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1317136637, now seen corresponding path program 1 times [2022-11-03 02:31:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:21,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139507879] [2022-11-03 02:31:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:21,940 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:31:21,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:21,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139507879] [2022-11-03 02:31:21,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139507879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:31:21,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:31:21,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:31:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617983255] [2022-11-03 02:31:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:31:21,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:31:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:21,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:31:21,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:31:21,943 INFO L87 Difference]: Start difference. First operand 3706 states and 8310 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:31:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:23,041 INFO L93 Difference]: Finished difference Result 3786 states and 8479 transitions. [2022-11-03 02:31:23,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:31:23,042 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:31:23,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:23,053 INFO L225 Difference]: With dead ends: 3786 [2022-11-03 02:31:23,053 INFO L226 Difference]: Without dead ends: 3786 [2022-11-03 02:31:23,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:31:23,055 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 136 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:23,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 37 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-03 02:31:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2022-11-03 02:31:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3786. [2022-11-03 02:31:23,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3578 states have (on average 2.369759642258245) internal successors, (8479), 3785 states have internal predecessors, (8479), 0 states have call successors, (0), 0 states 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:31:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 8479 transitions. [2022-11-03 02:31:23,205 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 8479 transitions. Word has length 11 [2022-11-03 02:31:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:23,206 INFO L495 AbstractCegarLoop]: Abstraction has 3786 states and 8479 transitions. [2022-11-03 02:31:23,206 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:31:23,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 8479 transitions. [2022-11-03 02:31:23,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:31:23,207 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:23,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:23,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:31:23,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1265559154, now seen corresponding path program 1 times [2022-11-03 02:31:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:23,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180937968] [2022-11-03 02:31:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:23,800 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:31:23,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180937968] [2022-11-03 02:31:23,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180937968] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:23,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252925447] [2022-11-03 02:31:23,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:23,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:23,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:23,803 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:23,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:31:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:24,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-03 02:31:24,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:24,086 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-03 02:31:24,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-03 02:31:24,158 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 23 treesize of output 23 [2022-11-03 02:31:24,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 02:31:24,269 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:31:24,284 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:31:24,285 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:31:24,335 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:31:24,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 23 treesize of output 23 [2022-11-03 02:31:24,489 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:31:24,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:24,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_840) |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:31:24,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_839) |c_~#pre~0.base| v_ArrVal_840) |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:31:24,738 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:31:24,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252925447] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:24,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [477379209] [2022-11-03 02:31:24,739 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:31:24,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:24,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 19 [2022-11-03 02:31:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445257376] [2022-11-03 02:31:24,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:31:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:24,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:31:24,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=279, Unknown=3, NotChecked=70, Total=420 [2022-11-03 02:31:24,742 INFO L87 Difference]: Start difference. First operand 3786 states and 8479 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:31:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:27,030 INFO L93 Difference]: Finished difference Result 3911 states and 8710 transitions. [2022-11-03 02:31:27,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:31:27,031 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:31:27,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:27,042 INFO L225 Difference]: With dead ends: 3911 [2022-11-03 02:31:27,042 INFO L226 Difference]: Without dead ends: 3911 [2022-11-03 02:31:27,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=382, Unknown=3, NotChecked=86, Total=600 [2022-11-03 02:31:27,043 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 320 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 933 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:27,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 55 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2243 Invalid, 0 Unknown, 933 Unchecked, 1.9s Time] [2022-11-03 02:31:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-11-03 02:31:27,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3786. [2022-11-03 02:31:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3581 states have (on average 2.367774364702597) internal successors, (8479), 3785 states have internal predecessors, (8479), 0 states have call successors, (0), 0 states 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:31:27,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 8479 transitions. [2022-11-03 02:31:27,133 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 8479 transitions. Word has length 12 [2022-11-03 02:31:27,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:27,134 INFO L495 AbstractCegarLoop]: Abstraction has 3786 states and 8479 transitions. [2022-11-03 02:31:27,134 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:31:27,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 8479 transitions. [2022-11-03 02:31:27,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:31:27,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:27,135 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:27,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:27,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-03 02:31:27,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:27,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2118420262, now seen corresponding path program 1 times [2022-11-03 02:31:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:27,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726920556] [2022-11-03 02:31:27,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:27,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:27,959 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:31:27,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:27,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726920556] [2022-11-03 02:31:27,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726920556] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424366425] [2022-11-03 02:31:27,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:27,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:27,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:27,961 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:27,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:31:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:28,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:31:28,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:28,213 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-03 02:31:28,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-03 02:31:28,280 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 23 treesize of output 23 [2022-11-03 02:31:28,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-03 02:31:28,387 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:31:28,409 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:31:28,410 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:31:28,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 23 treesize of output 23 [2022-11-03 02:31:28,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:28,525 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:31:28,664 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:31:28,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:28,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_973 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_973) |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:31:28,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_972) |c_~#pre~0.base| v_ArrVal_973) |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:31:28,979 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:31:28,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424366425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:28,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [910897703] [2022-11-03 02:31:28,980 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:31:28,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:28,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 21 [2022-11-03 02:31:28,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838197243] [2022-11-03 02:31:28,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:28,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 02:31:28,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:28,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 02:31:28,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=344, Unknown=3, NotChecked=78, Total=506 [2022-11-03 02:31:28,982 INFO L87 Difference]: Start difference. First operand 3786 states and 8479 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:31:30,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:30,996 INFO L93 Difference]: Finished difference Result 3827 states and 8525 transitions. [2022-11-03 02:31:30,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:31:30,997 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:31:30,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:31,005 INFO L225 Difference]: With dead ends: 3827 [2022-11-03 02:31:31,006 INFO L226 Difference]: Without dead ends: 3827 [2022-11-03 02:31:31,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=174, Invalid=533, Unknown=3, NotChecked=102, Total=812 [2022-11-03 02:31:31,007 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 315 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 642 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:31,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 44 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1859 Invalid, 0 Unknown, 642 Unchecked, 1.6s Time] [2022-11-03 02:31:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-11-03 02:31:31,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 3786. [2022-11-03 02:31:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3786 states, 3583 states have (on average 2.366452693273793) internal successors, (8479), 3785 states have internal predecessors, (8479), 0 states have call successors, (0), 0 states 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:31:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 8479 transitions. [2022-11-03 02:31:31,092 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 8479 transitions. Word has length 12 [2022-11-03 02:31:31,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:31,092 INFO L495 AbstractCegarLoop]: Abstraction has 3786 states and 8479 transitions. [2022-11-03 02:31:31,092 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:31:31,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 8479 transitions. [2022-11-03 02:31:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 02:31:31,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:31,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:31,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-03 02:31:31,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:31,310 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:31,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:31,310 INFO L85 PathProgramCache]: Analyzing trace with hash -577619978, now seen corresponding path program 1 times [2022-11-03 02:31:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:31,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139238617] [2022-11-03 02:31:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:31,895 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:31:31,895 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139238617] [2022-11-03 02:31:31,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139238617] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:31,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447945354] [2022-11-03 02:31:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:31,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:31,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:31,897 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:31,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:31:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:32,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:31:32,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:32,151 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-03 02:31:32,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-03 02:31:32,207 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 23 treesize of output 23 [2022-11-03 02:31:32,240 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 23 treesize of output 23 [2022-11-03 02:31:32,298 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:31:32,337 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:31:32,337 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:31:32,382 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:31:32,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:32,468 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:31:32,558 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:31:32,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:32,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1106 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1106) |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:31:32,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1105) |c_~#pre~0.base| v_ArrVal_1106) |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:31:32,798 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:31:32,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447945354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:32,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1846325450] [2022-11-03 02:31:32,799 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:31:32,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:32,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-11-03 02:31:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489481116] [2022-11-03 02:31:32,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:32,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:31:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:31:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=278, Unknown=4, NotChecked=70, Total=420 [2022-11-03 02:31:32,802 INFO L87 Difference]: Start difference. First operand 3786 states and 8479 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:31:34,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:34,494 INFO L93 Difference]: Finished difference Result 3805 states and 8485 transitions. [2022-11-03 02:31:34,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:31:34,495 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:31:34,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:34,504 INFO L225 Difference]: With dead ends: 3805 [2022-11-03 02:31:34,504 INFO L226 Difference]: Without dead ends: 3805 [2022-11-03 02:31:34,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=385, Unknown=4, NotChecked=86, Total=600 [2022-11-03 02:31:34,505 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 276 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 2448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 789 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:34,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 41 Invalid, 2448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1619 Invalid, 0 Unknown, 789 Unchecked, 1.3s Time] [2022-11-03 02:31:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3805 states. [2022-11-03 02:31:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3805 to 3770. [2022-11-03 02:31:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3569 states have (on average 2.3664892126646118) internal successors, (8446), 3769 states have internal predecessors, (8446), 0 states have call successors, (0), 0 states 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:31:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 8446 transitions. [2022-11-03 02:31:34,591 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 8446 transitions. Word has length 13 [2022-11-03 02:31:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 8446 transitions. [2022-11-03 02:31:34,592 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:31:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 8446 transitions. [2022-11-03 02:31:34,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:31:34,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:34,593 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:34,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:34,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 02:31:34,806 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting worker_fnErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:34,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash 12485739, now seen corresponding path program 1 times [2022-11-03 02:31:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:34,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221612433] [2022-11-03 02:31:34,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:35,399 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:31:35,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:35,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221612433] [2022-11-03 02:31:35,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221612433] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:35,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463404008] [2022-11-03 02:31:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:35,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:35,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:35,402 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:35,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:31:35,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:35,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-03 02:31:35,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:35,697 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-03 02:31:35,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-03 02:31:35,763 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 23 treesize of output 23 [2022-11-03 02:31:35,800 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 23 treesize of output 23 [2022-11-03 02:31:35,863 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:31:35,885 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-03 02:31:35,889 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:31:35,940 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:31:36,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:36,018 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:31:36,147 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:31:36,150 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:31:36,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:36,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| v_ArrVal_1238) |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:31:36,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1238 (Array Int Int)) (v_ArrVal_1237 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1237) |c_~#pre~0.base| v_ArrVal_1238) |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:31:36,435 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:31:36,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463404008] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:31:36,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [104085089] [2022-11-03 02:31:36,436 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:31:36,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:31:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2022-11-03 02:31:36,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382848848] [2022-11-03 02:31:36,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:31:36,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:31:36,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:31:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:31:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=425, Unknown=3, NotChecked=86, Total=600 [2022-11-03 02:31:36,440 INFO L87 Difference]: Start difference. First operand 3770 states and 8446 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:31:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:31:38,573 INFO L93 Difference]: Finished difference Result 3847 states and 8570 transitions. [2022-11-03 02:31:38,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:31:38,573 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:31:38,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:31:38,581 INFO L225 Difference]: With dead ends: 3847 [2022-11-03 02:31:38,581 INFO L226 Difference]: Without dead ends: 3847 [2022-11-03 02:31:38,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=626, Unknown=3, NotChecked=110, Total=930 [2022-11-03 02:31:38,582 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 403 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 983 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:31:38,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 70 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2112 Invalid, 0 Unknown, 983 Unchecked, 1.7s Time] [2022-11-03 02:31:38,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3847 states. [2022-11-03 02:31:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3847 to 3756. [2022-11-03 02:31:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3756 states, 3556 states have (on average 2.3669853768278966) internal successors, (8417), 3755 states have internal predecessors, (8417), 0 states have call successors, (0), 0 states 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:31:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3756 states to 3756 states and 8417 transitions. [2022-11-03 02:31:38,666 INFO L78 Accepts]: Start accepts. Automaton has 3756 states and 8417 transitions. Word has length 14 [2022-11-03 02:31:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:31:38,666 INFO L495 AbstractCegarLoop]: Abstraction has 3756 states and 8417 transitions. [2022-11-03 02:31:38,666 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:31:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 3756 states and 8417 transitions. [2022-11-03 02:31:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-03 02:31:38,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:31:38,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:31:38,706 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:31:38,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:38,891 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 37 more)] === [2022-11-03 02:31:38,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:31:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2066111042, now seen corresponding path program 1 times [2022-11-03 02:31:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:31:38,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331907523] [2022-11-03 02:31:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:31:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:40,085 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:31:40,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:31:40,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331907523] [2022-11-03 02:31:40,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331907523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:31:40,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800876789] [2022-11-03 02:31:40,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:31:40,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:31:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:31:40,090 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:31:40,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2490aeca-6c46-4341-9c7e-a5c29160b59f/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:31:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:31:40,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 93 conjunts are in the unsatisfiable core [2022-11-03 02:31:40,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:31:40,375 INFO L356 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-03 02:31:40,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2022-11-03 02:31:40,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:31:40,514 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:31:40,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:31:40,643 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:31:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 75 [2022-11-03 02:31:40,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:31:40,652 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 36 treesize of output 39 [2022-11-03 02:31:40,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-03 02:31:40,690 INFO L356 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2022-11-03 02:31:40,691 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:31:40,775 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:31:40,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, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2022-11-03 02:31:40,796 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:31:41,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 51 [2022-11-03 02:31:41,019 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:31:41,039 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:31:41,168 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:31:41,174 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:31:41,302 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:31:41,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:31:41,425 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#pre~0.base| (store (select |c_#memory_int| |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_#t~mem14#1|) v_ArrVal_1384)) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_1382) |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_1383) |c_ULTIMATE.start_worker_fn_~a~0#1.base|) |c_ULTIMATE.start_worker_fn_~a~0#1.offset|))) (< (select .cse0 (+ 4 .cse1)) (select .cse0 .cse1)))) is different from false [2022-11-03 02:31:41,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (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| (store (select |c_#memory_int| |c_~#pre~0.base|) (+ |c_~#pre~0.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|))) v_ArrVal_1384)) (select (select (store |c_#memory_$Pointer$.base| |c_~#pre~0.base| v_ArrVal_1382) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_~#pre~0.base| v_ArrVal_1383) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (< (select .cse0 (+ 4 .cse1)) (select .cse0 .cse1))))) is different from false [2022-11-03 02:31:41,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1379 (Array Int Int)) (v_ArrVal_1384 Int) (v_ArrVal_1383 (Array Int Int)) (v_ArrVal_1382 (Array Int Int)) (v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (let ((.cse2 (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|))) (let ((.cse0 (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1379))) (store .cse3 |c_~#pre~0.base| (store (select .cse3 |c_~#pre~0.base|) (+ |c_~#pre~0.offset| (select (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ 20 |c_ULTIMATE.start_main_~#a~1#1.offset|))) v_ArrVal_1384))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#worker~0#1.base| v_ArrVal_1381) |c_~#pre~0.base| v_ArrVal_1382) |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_1380) |c_~#pre~0.base| v_ArrVal_1383) |c_ULTIMATE.start_main_~#a~1#1.base|) .cse2))) (< (select .cse0 (+ .cse1 4)) (select .cse0 .cse1))))) is different from false [2022-11-03 02:31:41,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:31:41,687 INFO L356 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2022-11-03 02:31:41,688 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 3 case distinctions, treesize of input 469 treesize of output 296 [2022-11-03 02:31:41,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:31:41,713 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 235 treesize of output 218 [2022-11-03 02:31:41,744 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:31:41,744 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 2682 treesize of output 2660 [2022-11-03 02:31:41,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:31:41,776 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 2646 treesize of output 1788 [2022-11-03 02:31:42,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:31:42,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 32473 treesize of output 30475 [2022-11-03 02:31:42,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:31:42,327 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 1105410 treesize of output 1060100 [2022-11-03 02:31:47,934 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 1060086 treesize of output 939254 [2022-11-03 02:31:50,337 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 939254 treesize of output 878838 [2022-11-03 02:31:52,799 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 878838 treesize of output 848630 [2022-11-03 02:31:55,139 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 848710 treesize of output 846894 [2022-11-03 02:31:57,506 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 409096 treesize of output 408816 [2022-11-03 02:32:00,495 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:32:00,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 35 case distinctions, treesize of input 1233654 treesize of output 993054 [2022-11-03 02:33:01,059 WARN L234 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 1333 DAG size of output: 1333 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-03 02:33:01,332 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 922174 treesize of output 921382 [2022-11-03 02:33:05,749 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 14 treesize of output 8 [2022-11-03 02:33:21,898 WARN L234 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 1175 DAG size of output: 1175 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)