./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:53:36,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:53:36,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:53:36,926 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:53:36,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:53:36,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:53:36,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:53:36,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:53:36,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:53:36,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:53:36,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:53:36,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:53:36,949 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:53:36,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:53:36,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:53:36,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:53:36,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:53:36,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:53:36,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:53:36,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:53:36,968 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:53:36,971 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:53:36,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:53:36,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:53:36,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:53:36,990 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:53:36,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:53:36,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:53:36,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:53:36,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:53:36,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:53:36,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:53:36,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:53:36,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:53:37,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:53:37,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:53:37,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:53:37,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:53:37,006 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:53:37,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:53:37,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:53:37,009 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 23:53:37,057 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:53:37,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:53:37,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:53:37,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:53:37,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:53:37,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:53:37,060 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:53:37,060 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:53:37,061 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:53:37,061 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:53:37,062 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:53:37,063 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:53:37,063 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:53:37,063 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:53:37,064 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:53:37,064 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:53:37,064 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:53:37,065 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:53:37,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:53:37,066 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 23:53:37,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:53:37,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 23:53:37,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:53:37,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 23:53:37,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:53:37,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 23:53:37,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 23:53:37,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 23:53:37,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:53:37,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 23:53:37,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:53:37,070 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:53:37,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:53:37,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:53:37,071 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:53:37,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:53:37,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 23:53:37,072 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:53:37,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:53:37,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 23:53:37,073 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:53:37,073 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_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 [2022-11-25 23:53:37,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:53:37,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:53:37,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:53:37,504 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:53:37,505 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:53:37,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-25 23:53:41,152 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:53:41,402 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:53:41,403 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-25 23:53:41,411 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/data/665af1f03/c226d38b68a041dc941bd63b08d849f9/FLAGd7c137dd4 [2022-11-25 23:53:41,426 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/data/665af1f03/c226d38b68a041dc941bd63b08d849f9 [2022-11-25 23:53:41,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:53:41,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:53:41,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:53:41,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:53:41,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:53:41,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5346ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41, skipping insertion in model container [2022-11-25 23:53:41,439 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:53:41,469 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:53:41,632 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,641 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,647 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,678 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-25 23:53:41,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:53:41,701 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:53:41,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,717 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,722 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,728 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,730 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,731 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,732 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,733 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,734 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,735 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 23:53:41,736 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 23:53:41,744 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-25 23:53:41,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:53:41,765 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:53:41,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41 WrapperNode [2022-11-25 23:53:41,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:53:41,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:53:41,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:53:41,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:53:41,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,836 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 289 [2022-11-25 23:53:41,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:53:41,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:53:41,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:53:41,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:53:41,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,903 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:53:41,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:53:41,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:53:41,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:53:41,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (1/1) ... [2022-11-25 23:53:41,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:53:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:53:41,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:53:41,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:53:42,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 23:53:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:53:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:53:42,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:53:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-25 23:53:42,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-25 23:53:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-25 23:53:42,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-25 23:53:42,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-25 23:53:42,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-25 23:53:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-25 23:53:42,015 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-25 23:53:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 23:53:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-25 23:53:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-25 23:53:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-25 23:53:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-25 23:53:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 23:53:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 23:53:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 23:53:42,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:53:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:53:42,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:53:42,020 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 23:53:42,156 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:53:42,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:53:42,770 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:53:43,153 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:53:43,154 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 23:53:43,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:53:43 BoogieIcfgContainer [2022-11-25 23:53:43,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:53:43,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:53:43,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:53:43,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:53:43,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:53:41" (1/3) ... [2022-11-25 23:53:43,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8c5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:53:43, skipping insertion in model container [2022-11-25 23:53:43,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:53:41" (2/3) ... [2022-11-25 23:53:43,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8c5428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:53:43, skipping insertion in model container [2022-11-25 23:53:43,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:53:43" (3/3) ... [2022-11-25 23:53:43,172 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-11-25 23:53:43,184 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 23:53:43,194 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:53:43,194 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 23:53:43,194 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 23:53:43,368 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-11-25 23:53:43,435 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 23:53:43,472 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-25 23:53:43,475 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-25 23:53:43,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 260 transitions, 592 flow [2022-11-25 23:53:43,679 INFO L130 PetriNetUnfolder]: 18/232 cut-off events. [2022-11-25 23:53:43,680 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-25 23:53:43,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 232 events. 18/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 285 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 200. Up to 3 conditions per place. [2022-11-25 23:53:43,702 INFO L119 LiptonReduction]: Number of co-enabled transitions 7312 [2022-11-25 23:53:53,327 INFO L134 LiptonReduction]: Checked pairs total: 36353 [2022-11-25 23:53:53,328 INFO L136 LiptonReduction]: Total number of compositions: 204 [2022-11-25 23:53:53,336 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 82 transitions, 236 flow [2022-11-25 23:53:53,832 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:53,860 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:53:53,870 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;@5a5a8700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:53:53,871 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-25 23:53:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 23:53:53,947 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:53,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:53,948 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:53:53,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash 325335062, now seen corresponding path program 1 times [2022-11-25 23:53:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:53,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928105994] [2022-11-25 23:53:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:54,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:54,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:54,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928105994] [2022-11-25 23:53:54,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928105994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:53:54,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:53:54,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:53:54,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461558804] [2022-11-25 23:53:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:53:54,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:53:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:54,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:53:54,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:53:54,890 INFO L87 Difference]: Start difference. First operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 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 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:55,606 INFO L93 Difference]: Finished difference Result 14006 states and 64835 transitions. [2022-11-25 23:53:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:53:55,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-25 23:53:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:55,805 INFO L225 Difference]: With dead ends: 14006 [2022-11-25 23:53:55,805 INFO L226 Difference]: Without dead ends: 13825 [2022-11-25 23:53:55,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-25 23:53:55,811 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 85 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:55,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:53:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13825 states. [2022-11-25 23:53:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13825 to 6933. [2022-11-25 23:53:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6932 states have (on average 4.474321984997115) internal successors, (31016), 6932 states have internal predecessors, (31016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 31016 transitions. [2022-11-25 23:53:56,577 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 31016 transitions. Word has length 52 [2022-11-25 23:53:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:56,579 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 31016 transitions. [2022-11-25 23:53:56,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:56,580 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 31016 transitions. [2022-11-25 23:53:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 23:53:56,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:56,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:56,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:53:56,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:53:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 432429094, now seen corresponding path program 2 times [2022-11-25 23:53:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:56,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558751794] [2022-11-25 23:53:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:56,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:56,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:56,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558751794] [2022-11-25 23:53:56,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558751794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:53:56,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:53:56,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:53:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519917331] [2022-11-25 23:53:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:53:56,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:53:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:56,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:53:56,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:53:56,998 INFO L87 Difference]: Start difference. First operand 6933 states and 31016 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:57,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:57,677 INFO L93 Difference]: Finished difference Result 15474 states and 71548 transitions. [2022-11-25 23:53:57,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:53:57,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-25 23:53:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:53:57,798 INFO L225 Difference]: With dead ends: 15474 [2022-11-25 23:53:57,798 INFO L226 Difference]: Without dead ends: 15293 [2022-11-25 23:53:57,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-25 23:53:57,801 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:53:57,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 90 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:53:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15293 states. [2022-11-25 23:53:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15293 to 7065. [2022-11-25 23:53:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7064 states have (on average 4.462061155152888) internal successors, (31520), 7064 states have internal predecessors, (31520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 31520 transitions. [2022-11-25 23:53:58,819 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 31520 transitions. Word has length 52 [2022-11-25 23:53:58,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:53:58,820 INFO L495 AbstractCegarLoop]: Abstraction has 7065 states and 31520 transitions. [2022-11-25 23:53:58,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:58,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 31520 transitions. [2022-11-25 23:53:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:53:58,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:53:58,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:53:58,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:53:58,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:53:58,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:53:58,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582988, now seen corresponding path program 1 times [2022-11-25 23:53:58,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:53:58,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837638231] [2022-11-25 23:53:58,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:53:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:53:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:53:59,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:53:59,469 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:53:59,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837638231] [2022-11-25 23:53:59,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837638231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:53:59,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:53:59,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:53:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556900158] [2022-11-25 23:53:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:53:59,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:53:59,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:53:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:53:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:53:59,471 INFO L87 Difference]: Start difference. First operand 7065 states and 31520 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:53:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:53:59,976 INFO L93 Difference]: Finished difference Result 11967 states and 49648 transitions. [2022-11-25 23:53:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:53:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-25 23:53:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:00,062 INFO L225 Difference]: With dead ends: 11967 [2022-11-25 23:54:00,062 INFO L226 Difference]: Without dead ends: 11355 [2022-11-25 23:54:00,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:54:00,064 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:00,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 114 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:54:00,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2022-11-25 23:54:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 8501. [2022-11-25 23:54:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8500 states have (on average 4.270117647058823) internal successors, (36296), 8500 states have internal predecessors, (36296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 36296 transitions. [2022-11-25 23:54:00,642 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 36296 transitions. Word has length 54 [2022-11-25 23:54:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:00,646 INFO L495 AbstractCegarLoop]: Abstraction has 8501 states and 36296 transitions. [2022-11-25 23:54:00,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:00,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 36296 transitions. [2022-11-25 23:54:00,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 23:54:00,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:00,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:00,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:54:00,686 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:00,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:00,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1721045454, now seen corresponding path program 1 times [2022-11-25 23:54:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:00,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631588017] [2022-11-25 23:54:00,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:01,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:01,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631588017] [2022-11-25 23:54:01,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631588017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:54:01,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:54:01,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:54:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507438080] [2022-11-25 23:54:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:01,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:54:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:01,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:54:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:54:01,075 INFO L87 Difference]: Start difference. First operand 8501 states and 36296 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:01,506 INFO L93 Difference]: Finished difference Result 8515 states and 34660 transitions. [2022-11-25 23:54:01,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:54:01,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-25 23:54:01,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:01,565 INFO L225 Difference]: With dead ends: 8515 [2022-11-25 23:54:01,565 INFO L226 Difference]: Without dead ends: 6868 [2022-11-25 23:54:01,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:54:01,569 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 94 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:01,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 89 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:54:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-11-25 23:54:01,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2022-11-25 23:54:01,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6868 states, 6867 states have (on average 4.300859181593126) internal successors, (29534), 6867 states have internal predecessors, (29534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 29534 transitions. [2022-11-25 23:54:01,815 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 29534 transitions. Word has length 54 [2022-11-25 23:54:01,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:01,816 INFO L495 AbstractCegarLoop]: Abstraction has 6868 states and 29534 transitions. [2022-11-25 23:54:01,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 29534 transitions. [2022-11-25 23:54:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 23:54:01,848 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:01,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:01,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:54:01,849 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2126341667, now seen corresponding path program 1 times [2022-11-25 23:54:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:01,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377324782] [2022-11-25 23:54:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:01,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:02,307 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:02,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377324782] [2022-11-25 23:54:02,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377324782] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:02,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894859759] [2022-11-25 23:54:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:02,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:02,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:02,315 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:02,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:54:02,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:02,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:54:02,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:02,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:02,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:02,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894859759] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:02,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1926170578] [2022-11-25 23:54:02,943 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:02,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:02,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-25 23:54:02,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083022858] [2022-11-25 23:54:02,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:02,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 23:54:02,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:02,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 23:54:02,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:54:02,954 INFO L87 Difference]: Start difference. First operand 6868 states and 29534 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:03,441 INFO L93 Difference]: Finished difference Result 11572 states and 48055 transitions. [2022-11-25 23:54:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:54:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-25 23:54:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:03,588 INFO L225 Difference]: With dead ends: 11572 [2022-11-25 23:54:03,588 INFO L226 Difference]: Without dead ends: 11356 [2022-11-25 23:54:03,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-25 23:54:03,589 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 200 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:03,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 222 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 23:54:03,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11356 states. [2022-11-25 23:54:03,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11356 to 8502. [2022-11-25 23:54:04,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8502 states, 8501 states have (on average 4.26973297259146) internal successors, (36297), 8501 states have internal predecessors, (36297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8502 states to 8502 states and 36297 transitions. [2022-11-25 23:54:04,092 INFO L78 Accepts]: Start accepts. Automaton has 8502 states and 36297 transitions. Word has length 55 [2022-11-25 23:54:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:04,092 INFO L495 AbstractCegarLoop]: Abstraction has 8502 states and 36297 transitions. [2022-11-25 23:54:04,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 8502 states and 36297 transitions. [2022-11-25 23:54:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 23:54:04,129 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:04,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:04,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:04,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:04,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -786283212, now seen corresponding path program 1 times [2022-11-25 23:54:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:04,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163151584] [2022-11-25 23:54:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:04,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:04,845 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163151584] [2022-11-25 23:54:04,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163151584] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:04,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601199101] [2022-11-25 23:54:04,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:04,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:04,847 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:04,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:54:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:05,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 23:54:05,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:05,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:05,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601199101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:05,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320922885] [2022-11-25 23:54:05,274 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:05,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:05,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-25 23:54:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461877821] [2022-11-25 23:54:05,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:05,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 23:54:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:05,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 23:54:05,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:54:05,277 INFO L87 Difference]: Start difference. First operand 8502 states and 36297 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:05,591 INFO L93 Difference]: Finished difference Result 8516 states and 33499 transitions. [2022-11-25 23:54:05,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 23:54:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-25 23:54:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:05,623 INFO L225 Difference]: With dead ends: 8516 [2022-11-25 23:54:05,624 INFO L226 Difference]: Without dead ends: 6407 [2022-11-25 23:54:05,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:54:05,625 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 230 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:05,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 106 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:54:05,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-11-25 23:54:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6407. [2022-11-25 23:54:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6407 states, 6406 states have (on average 4.153137683421792) internal successors, (26605), 6406 states have internal predecessors, (26605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 26605 transitions. [2022-11-25 23:54:05,836 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 26605 transitions. Word has length 55 [2022-11-25 23:54:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:05,836 INFO L495 AbstractCegarLoop]: Abstraction has 6407 states and 26605 transitions. [2022-11-25 23:54:05,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:05,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 26605 transitions. [2022-11-25 23:54:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 23:54:05,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:05,862 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:05,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:06,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:06,069 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:06,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1708564349, now seen corresponding path program 2 times [2022-11-25 23:54:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:06,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453325413] [2022-11-25 23:54:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:06,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:06,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453325413] [2022-11-25 23:54:06,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453325413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:06,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781230241] [2022-11-25 23:54:06,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:54:06,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:06,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:06,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:06,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:54:06,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:54:06,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:54:06,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:54:06,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:06,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:06,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781230241] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:06,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:54:06,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-25 23:54:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6259704] [2022-11-25 23:54:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:06,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:54:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:54:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-25 23:54:06,784 INFO L87 Difference]: Start difference. First operand 6407 states and 26605 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:06,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:06,983 INFO L93 Difference]: Finished difference Result 6455 states and 27235 transitions. [2022-11-25 23:54:06,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:54:06,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-25 23:54:06,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:07,037 INFO L225 Difference]: With dead ends: 6455 [2022-11-25 23:54:07,037 INFO L226 Difference]: Without dead ends: 6455 [2022-11-25 23:54:07,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:54:07,038 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 207 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:07,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 46 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:54:07,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2022-11-25 23:54:07,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5703. [2022-11-25 23:54:07,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 4.283584707120308) internal successors, (24425), 5702 states have internal predecessors, (24425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 24425 transitions. [2022-11-25 23:54:07,322 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 24425 transitions. Word has length 56 [2022-11-25 23:54:07,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:07,322 INFO L495 AbstractCegarLoop]: Abstraction has 5703 states and 24425 transitions. [2022-11-25 23:54:07,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 24425 transitions. [2022-11-25 23:54:07,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-25 23:54:07,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:07,345 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:07,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:07,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-25 23:54:07,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash -747093958, now seen corresponding path program 1 times [2022-11-25 23:54:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:07,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985711419] [2022-11-25 23:54:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:07,998 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-25 23:54:07,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:07,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985711419] [2022-11-25 23:54:07,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985711419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:07,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65305671] [2022-11-25 23:54:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:07,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:08,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:08,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:54:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:08,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 23:54:08,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:08,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:08,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 23:54:08,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65305671] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:08,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 23:54:08,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2022-11-25 23:54:08,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809102455] [2022-11-25 23:54:08,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:54:08,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:54:08,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:08,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:54:08,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-25 23:54:08,493 INFO L87 Difference]: Start difference. First operand 5703 states and 24425 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:08,689 INFO L93 Difference]: Finished difference Result 6387 states and 27545 transitions. [2022-11-25 23:54:08,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:54:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-25 23:54:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:08,723 INFO L225 Difference]: With dead ends: 6387 [2022-11-25 23:54:08,724 INFO L226 Difference]: Without dead ends: 6387 [2022-11-25 23:54:08,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-25 23:54:08,726 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 140 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:08,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 49 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:54:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2022-11-25 23:54:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6387. [2022-11-25 23:54:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 6386 states have (on average 4.313341684935797) internal successors, (27545), 6386 states have internal predecessors, (27545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 27545 transitions. [2022-11-25 23:54:09,002 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 27545 transitions. Word has length 56 [2022-11-25 23:54:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:09,003 INFO L495 AbstractCegarLoop]: Abstraction has 6387 states and 27545 transitions. [2022-11-25 23:54:09,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 27545 transitions. [2022-11-25 23:54:09,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:54:09,024 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:09,024 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:09,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:09,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:09,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 526565857, now seen corresponding path program 1 times [2022-11-25 23:54:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:09,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468704114] [2022-11-25 23:54:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:09,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:10,734 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-25 23:54:10,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:10,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468704114] [2022-11-25 23:54:10,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468704114] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168293295] [2022-11-25 23:54:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:10,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:10,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:10,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:10,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:54:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:10,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 23:54:10,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:11,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:11,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:11,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:54:11,530 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-25 23:54:11,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:11,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-11-25 23:54:11,766 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-25 23:54:11,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:54:11,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-25 23:54:11,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-25 23:54:11,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:11,822 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:54:11,822 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 23:54:12,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-25 23:54:12,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168293295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:12,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [714666667] [2022-11-25 23:54:12,066 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:12,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:12,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-11-25 23:54:12,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558632833] [2022-11-25 23:54:12,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:12,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 23:54:12,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:12,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 23:54:12,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=360, Unknown=2, NotChecked=78, Total=506 [2022-11-25 23:54:12,070 INFO L87 Difference]: Start difference. First operand 6387 states and 27545 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:13,943 INFO L93 Difference]: Finished difference Result 13020 states and 57913 transitions. [2022-11-25 23:54:13,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 23:54:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:54:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:13,997 INFO L225 Difference]: With dead ends: 13020 [2022-11-25 23:54:13,997 INFO L226 Difference]: Without dead ends: 12099 [2022-11-25 23:54:13,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=852, Unknown=2, NotChecked=126, Total=1190 [2022-11-25 23:54:14,000 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 453 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 411 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:14,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 401 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1590 Invalid, 0 Unknown, 411 Unchecked, 1.2s Time] [2022-11-25 23:54:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12099 states. [2022-11-25 23:54:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12099 to 7427. [2022-11-25 23:54:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7426 states have (on average 4.35591166172906) internal successors, (32347), 7426 states have internal predecessors, (32347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 32347 transitions. [2022-11-25 23:54:14,349 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 32347 transitions. Word has length 58 [2022-11-25 23:54:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:14,349 INFO L495 AbstractCegarLoop]: Abstraction has 7427 states and 32347 transitions. [2022-11-25 23:54:14,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 32347 transitions. [2022-11-25 23:54:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:54:14,371 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:14,372 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:14,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:14,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:14,579 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2007082927, now seen corresponding path program 2 times [2022-11-25 23:54:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639371566] [2022-11-25 23:54:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:16,108 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-25 23:54:16,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:16,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639371566] [2022-11-25 23:54:16,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639371566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:16,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147990094] [2022-11-25 23:54:16,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:54:16,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:16,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:16,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:16,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:54:16,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-25 23:54:16,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:54:16,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-25 23:54:16,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:16,390 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-25 23:54:16,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-25 23:54:16,484 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-25 23:54:16,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 23:54:16,531 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 23:54:16,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-25 23:54:16,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:16,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:17,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-25 23:54:17,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:54:17,274 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-25 23:54:17,274 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:17,428 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_575 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_575 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-25 23:54:17,536 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)))))) is different from false [2022-11-25 23:54:17,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:54:17,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-25 23:54:17,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 140 [2022-11-25 23:54:17,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-11-25 23:54:17,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:17,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:17,700 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:54:17,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 23:54:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-25 23:54:18,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147990094] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:18,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [259890263] [2022-11-25 23:54:18,148 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:18,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:18,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-25 23:54:18,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664069411] [2022-11-25 23:54:18,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:18,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-25 23:54:18,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:18,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-25 23:54:18,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=613, Unknown=6, NotChecked=102, Total=812 [2022-11-25 23:54:18,152 INFO L87 Difference]: Start difference. First operand 7427 states and 32347 transitions. Second operand has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:35,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:35,522 INFO L93 Difference]: Finished difference Result 16105 states and 70735 transitions. [2022-11-25 23:54:35,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-25 23:54:35,523 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:54:35,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:35,582 INFO L225 Difference]: With dead ends: 16105 [2022-11-25 23:54:35,583 INFO L226 Difference]: Without dead ends: 15142 [2022-11-25 23:54:35,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 94 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=692, Invalid=2969, Unknown=7, NotChecked=238, Total=3906 [2022-11-25 23:54:35,584 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1065 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 2766 mSolverCounterSat, 35 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 3528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2766 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 686 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:35,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 618 Invalid, 3528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2766 Invalid, 41 Unknown, 686 Unchecked, 2.7s Time] [2022-11-25 23:54:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15142 states. [2022-11-25 23:54:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15142 to 7629. [2022-11-25 23:54:35,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7629 states, 7628 states have (on average 4.358023072889355) internal successors, (33243), 7628 states have internal predecessors, (33243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7629 states to 7629 states and 33243 transitions. [2022-11-25 23:54:35,934 INFO L78 Accepts]: Start accepts. Automaton has 7629 states and 33243 transitions. Word has length 58 [2022-11-25 23:54:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:35,936 INFO L495 AbstractCegarLoop]: Abstraction has 7629 states and 33243 transitions. [2022-11-25 23:54:35,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 7629 states and 33243 transitions. [2022-11-25 23:54:35,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:54:35,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:35,960 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:35,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:36,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:54:36,167 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2068287604, now seen corresponding path program 1 times [2022-11-25 23:54:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:36,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946787081] [2022-11-25 23:54:36,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:36,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:37,860 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-25 23:54:37,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:37,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946787081] [2022-11-25 23:54:37,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946787081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:37,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549155336] [2022-11-25 23:54:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:37,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:37,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:37,862 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:37,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:54:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:38,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 23:54:38,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:38,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:38,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:38,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:54:38,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:39,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 23:54:39,126 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-25 23:54:39,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:39,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_651 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-25 23:54:39,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:54:39,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-25 23:54:39,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-11-25 23:54:39,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-11-25 23:54:39,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:39,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:39,832 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:54:39,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 23:54:40,281 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-25 23:54:40,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549155336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:40,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1096239835] [2022-11-25 23:54:40,282 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:40,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:40,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-25 23:54:40,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666928255] [2022-11-25 23:54:40,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:40,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-25 23:54:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-25 23:54:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=693, Unknown=9, NotChecked=54, Total=870 [2022-11-25 23:54:40,285 INFO L87 Difference]: Start difference. First operand 7629 states and 33243 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:43,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:43,117 INFO L93 Difference]: Finished difference Result 12984 states and 57964 transitions. [2022-11-25 23:54:43,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:54:43,117 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:54:43,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:43,171 INFO L225 Difference]: With dead ends: 12984 [2022-11-25 23:54:43,171 INFO L226 Difference]: Without dead ends: 12103 [2022-11-25 23:54:43,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=345, Invalid=1456, Unknown=9, NotChecked=82, Total=1892 [2022-11-25 23:54:43,173 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 702 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 330 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:43,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 430 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1749 Invalid, 0 Unknown, 330 Unchecked, 1.8s Time] [2022-11-25 23:54:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12103 states. [2022-11-25 23:54:43,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12103 to 7853. [2022-11-25 23:54:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 7852 states have (on average 4.371752419765665) internal successors, (34327), 7852 states have internal predecessors, (34327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 34327 transitions. [2022-11-25 23:54:43,570 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 34327 transitions. Word has length 58 [2022-11-25 23:54:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:43,570 INFO L495 AbstractCegarLoop]: Abstraction has 7853 states and 34327 transitions. [2022-11-25 23:54:43,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 34327 transitions. [2022-11-25 23:54:43,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:54:43,601 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:43,601 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:54:43,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:43,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-25 23:54:43,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:54:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash 502013827, now seen corresponding path program 3 times [2022-11-25 23:54:43,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:43,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138878509] [2022-11-25 23:54:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:54:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:54:45,486 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-25 23:54:45,487 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:54:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138878509] [2022-11-25 23:54:45,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138878509] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:54:45,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815488460] [2022-11-25 23:54:45,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:54:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:54:45,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:54:45,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 23:54:45,743 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:54:45,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:54:45,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-25 23:54:45,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:54:45,795 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-25 23:54:45,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-25 23:54:45,986 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:54:45,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 23:54:46,092 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:54:46,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 23:54:46,537 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-25 23:54:46,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-11-25 23:54:46,606 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-25 23:54:46,607 INFO L350 Elim1Store]: Elim1 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-25 23:54:47,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:47,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:54:47,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:54:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:47,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:54:48,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:54:48,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-25 23:54:48,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 148 [2022-11-25 23:54:48,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-11-25 23:54:48,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:48,532 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:54:48,542 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:54:48,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:54:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:54:50,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815488460] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:54:50,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [606236031] [2022-11-25 23:54:50,006 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:54:50,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:54:50,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 37 [2022-11-25 23:54:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884744282] [2022-11-25 23:54:50,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:54:50,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-25 23:54:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:54:50,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-25 23:54:50,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1308, Unknown=23, NotChecked=0, Total=1482 [2022-11-25 23:54:50,015 INFO L87 Difference]: Start difference. First operand 7853 states and 34327 transitions. Second operand has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:02,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:04,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:28,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:30,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:33,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:35,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:41,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:45,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:55:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:46,723 INFO L93 Difference]: Finished difference Result 29729 states and 127727 transitions. [2022-11-25 23:55:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-11-25 23:55:46,724 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:55:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:46,824 INFO L225 Difference]: With dead ends: 29729 [2022-11-25 23:55:46,824 INFO L226 Difference]: Without dead ends: 28940 [2022-11-25 23:55:46,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 87 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3664 ImplicationChecksByTransitivity, 29.9s TimeCoverageRelationStatistics Valid=2153, Invalid=10164, Unknown=115, NotChecked=0, Total=12432 [2022-11-25 23:55:46,827 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 3026 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 4616 mSolverCounterSat, 154 mSolverCounterUnsat, 185 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3026 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 4955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 4616 IncrementalHoareTripleChecker+Invalid, 185 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:46,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3026 Valid, 917 Invalid, 4955 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [154 Valid, 4616 Invalid, 185 Unknown, 0 Unchecked, 28.1s Time] [2022-11-25 23:55:46,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28940 states. [2022-11-25 23:55:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28940 to 7531. [2022-11-25 23:55:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7531 states, 7530 states have (on average 4.365869853917663) internal successors, (32875), 7530 states have internal predecessors, (32875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7531 states to 7531 states and 32875 transitions. [2022-11-25 23:55:47,201 INFO L78 Accepts]: Start accepts. Automaton has 7531 states and 32875 transitions. Word has length 58 [2022-11-25 23:55:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 7531 states and 32875 transitions. [2022-11-25 23:55:47,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 7531 states and 32875 transitions. [2022-11-25 23:55:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:55:47,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:47,226 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:47,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 23:55:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:47,437 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:55:47,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1123086771, now seen corresponding path program 4 times [2022-11-25 23:55:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:47,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349003723] [2022-11-25 23:55:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:47,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:48,563 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-25 23:55:48,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:48,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349003723] [2022-11-25 23:55:48,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349003723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:55:48,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399081627] [2022-11-25 23:55:48,564 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:55:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:55:48,566 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:55:48,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 23:55:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:48,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 23:55:48,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:55:49,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:49,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:55:49,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:55:49,647 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-25 23:55:49,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:55:50,003 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_808 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_808) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_808 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_808) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-25 23:55:50,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:55:50,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 45 [2022-11-25 23:55:50,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2022-11-25 23:55:50,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:55:50,057 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:55:50,057 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:55:50,427 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-25 23:55:50,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399081627] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:55:50,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [548390836] [2022-11-25 23:55:50,427 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:55:50,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:55:50,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-25 23:55:50,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104344925] [2022-11-25 23:55:50,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:55:50,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:55:50,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:50,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:55:50,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=355, Unknown=1, NotChecked=38, Total=462 [2022-11-25 23:55:50,430 INFO L87 Difference]: Start difference. First operand 7531 states and 32875 transitions. Second operand has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:52,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:52,630 INFO L93 Difference]: Finished difference Result 13458 states and 60236 transitions. [2022-11-25 23:55:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:55:52,630 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:55:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:52,669 INFO L225 Difference]: With dead ends: 13458 [2022-11-25 23:55:52,669 INFO L226 Difference]: Without dead ends: 12537 [2022-11-25 23:55:52,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 99 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=796, Unknown=1, NotChecked=60, Total=1056 [2022-11-25 23:55:52,669 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 417 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 244 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:52,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 389 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1339 Invalid, 0 Unknown, 244 Unchecked, 1.5s Time] [2022-11-25 23:55:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2022-11-25 23:55:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 7707. [2022-11-25 23:55:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7707 states, 7706 states have (on average 4.3798338956657155) internal successors, (33751), 7706 states have internal predecessors, (33751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7707 states to 7707 states and 33751 transitions. [2022-11-25 23:55:52,884 INFO L78 Accepts]: Start accepts. Automaton has 7707 states and 33751 transitions. Word has length 58 [2022-11-25 23:55:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:52,884 INFO L495 AbstractCegarLoop]: Abstraction has 7707 states and 33751 transitions. [2022-11-25 23:55:52,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.238095238095238) internal successors, (110), 21 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 7707 states and 33751 transitions. [2022-11-25 23:55:52,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:55:52,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:52,899 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:52,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-11-25 23:55:53,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:53,100 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:55:53,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1988938719, now seen corresponding path program 5 times [2022-11-25 23:55:53,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:53,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450131540] [2022-11-25 23:55:53,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:53,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:54,146 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-25 23:55:54,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450131540] [2022-11-25 23:55:54,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450131540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:55:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664312921] [2022-11-25 23:55:54,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:55:54,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:55:54,149 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:55:54,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 23:55:54,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:55:54,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:55:54,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-25 23:55:54,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:55:54,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:54,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:55:55,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:55:55,234 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-25 23:55:55,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:55:55,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:55:55,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-25 23:55:55,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-25 23:55:55,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:55:55,737 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:55:55,738 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 23:55:56,076 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-25 23:55:56,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664312921] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:55:56,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [643978643] [2022-11-25 23:55:56,077 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:55:56,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:55:56,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-25 23:55:56,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241539777] [2022-11-25 23:55:56,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:55:56,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-25 23:55:56,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:55:56,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-25 23:55:56,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=386, Unknown=6, NotChecked=0, Total=462 [2022-11-25 23:55:56,081 INFO L87 Difference]: Start difference. First operand 7707 states and 33751 transitions. Second operand has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:58,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:55:58,426 INFO L93 Difference]: Finished difference Result 13478 states and 60294 transitions. [2022-11-25 23:55:58,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:55:58,427 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:55:58,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:55:58,546 INFO L225 Difference]: With dead ends: 13478 [2022-11-25 23:55:58,546 INFO L226 Difference]: Without dead ends: 12545 [2022-11-25 23:55:58,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=843, Unknown=10, NotChecked=0, Total=1056 [2022-11-25 23:55:58,547 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 459 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-25 23:55:58,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 430 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-25 23:55:58,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12545 states. [2022-11-25 23:55:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12545 to 8023. [2022-11-25 23:55:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8023 states, 8022 states have (on average 4.386063325853902) internal successors, (35185), 8022 states have internal predecessors, (35185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8023 states to 8023 states and 35185 transitions. [2022-11-25 23:55:58,737 INFO L78 Accepts]: Start accepts. Automaton has 8023 states and 35185 transitions. Word has length 58 [2022-11-25 23:55:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:55:58,737 INFO L495 AbstractCegarLoop]: Abstraction has 8023 states and 35185 transitions. [2022-11-25 23:55:58,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:55:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 8023 states and 35185 transitions. [2022-11-25 23:55:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:55:58,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:55:58,759 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:55:58,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 23:55:58,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-25 23:55:58,965 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:55:58,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:55:58,966 INFO L85 PathProgramCache]: Analyzing trace with hash 658175327, now seen corresponding path program 6 times [2022-11-25 23:55:58,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:55:58,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66183538] [2022-11-25 23:55:58,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:55:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:00,179 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-25 23:56:00,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:00,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66183538] [2022-11-25 23:56:00,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66183538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:00,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697421635] [2022-11-25 23:56:00,180 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:56:00,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:00,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:00,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 23:56:00,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:56:00,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:56:00,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 23:56:00,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:00,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:00,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:01,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:01,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:01,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:56:01,452 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-25 23:56:01,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:01,945 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_958) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_959) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_958) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_959) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-25 23:56:01,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:01,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 91 [2022-11-25 23:56:01,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2022-11-25 23:56:01,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 58 [2022-11-25 23:56:02,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:02,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:02,041 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:56:02,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-25 23:56:02,472 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-25 23:56:02,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697421635] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:02,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [590837704] [2022-11-25 23:56:02,473 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:56:02,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:02,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-25 23:56:02,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670238868] [2022-11-25 23:56:02,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:56:02,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:56:02,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:02,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:56:02,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=590, Unknown=11, NotChecked=50, Total=756 [2022-11-25 23:56:02,476 INFO L87 Difference]: Start difference. First operand 8023 states and 35185 transitions. Second operand has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:05,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:05,749 INFO L93 Difference]: Finished difference Result 14310 states and 64178 transitions. [2022-11-25 23:56:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 23:56:05,750 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:56:05,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:05,802 INFO L225 Difference]: With dead ends: 14310 [2022-11-25 23:56:05,802 INFO L226 Difference]: Without dead ends: 13509 [2022-11-25 23:56:05,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=311, Invalid=1242, Unknown=11, NotChecked=76, Total=1640 [2022-11-25 23:56:05,803 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 597 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:05,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 536 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2104 Invalid, 0 Unknown, 134 Unchecked, 2.4s Time] [2022-11-25 23:56:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13509 states. [2022-11-25 23:56:06,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13509 to 8103. [2022-11-25 23:56:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8103 states, 8102 states have (on average 4.392619106393483) internal successors, (35589), 8102 states have internal predecessors, (35589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 35589 transitions. [2022-11-25 23:56:06,165 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 35589 transitions. Word has length 58 [2022-11-25 23:56:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:06,165 INFO L495 AbstractCegarLoop]: Abstraction has 8103 states and 35589 transitions. [2022-11-25 23:56:06,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 35589 transitions. [2022-11-25 23:56:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:56:06,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:06,190 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:06,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 23:56:06,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 23:56:06,397 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:56:06,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash -306655221, now seen corresponding path program 7 times [2022-11-25 23:56:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:06,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359516308] [2022-11-25 23:56:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:06,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:07,583 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-25 23:56:07,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:07,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359516308] [2022-11-25 23:56:07,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359516308] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:07,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493144117] [2022-11-25 23:56:07,584 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:56:07,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:07,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:07,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:07,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 23:56:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:07,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-25 23:56:07,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:08,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:08,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:08,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:08,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:08,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:56:08,850 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-25 23:56:08,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:09,133 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (+ c_~s_6~0 c_~t_8~0))) (and (forall ((v_ArrVal_1035 (Array Int Int))) (< .cse0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1035) c_~X_0~0.base) .cse1) 1 c_~s_2~0))) (forall ((v_ArrVal_1035 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1035) c_~X_0~0.base) .cse1) c_~s_2~0) .cse0)))) is different from false [2022-11-25 23:56:09,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (+ c_~s_6~0 c_~t_8~0))) (and (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (< .cse0 (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1034) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1035) c_~X_0~0.base) .cse1) 1 c_~s_2~0))) (forall ((v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1034) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1035) c_~X_0~0.base) .cse1) c_~s_2~0) .cse0)))) is different from false [2022-11-25 23:56:09,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:09,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-25 23:56:09,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2022-11-25 23:56:09,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 134 [2022-11-25 23:56:09,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:09,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:09,359 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:56:09,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:09,774 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-25 23:56:09,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493144117] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:09,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [443746568] [2022-11-25 23:56:09,775 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:56:09,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:09,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-25 23:56:09,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410663436] [2022-11-25 23:56:09,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:56:09,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-25 23:56:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:09,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-25 23:56:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=554, Unknown=2, NotChecked=98, Total=756 [2022-11-25 23:56:09,779 INFO L87 Difference]: Start difference. First operand 8103 states and 35589 transitions. Second operand has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:12,659 INFO L93 Difference]: Finished difference Result 14054 states and 62926 transitions. [2022-11-25 23:56:12,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-25 23:56:12,659 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:56:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:12,702 INFO L225 Difference]: With dead ends: 14054 [2022-11-25 23:56:12,703 INFO L226 Difference]: Without dead ends: 13253 [2022-11-25 23:56:12,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=316, Invalid=1250, Unknown=2, NotChecked=154, Total=1722 [2022-11-25 23:56:12,704 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 674 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:12,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 407 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1617 Invalid, 0 Unknown, 446 Unchecked, 1.9s Time] [2022-11-25 23:56:12,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13253 states. [2022-11-25 23:56:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13253 to 7975. [2022-11-25 23:56:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7975 states, 7974 states have (on average 4.381866064710309) internal successors, (34941), 7974 states have internal predecessors, (34941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7975 states to 7975 states and 34941 transitions. [2022-11-25 23:56:12,926 INFO L78 Accepts]: Start accepts. Automaton has 7975 states and 34941 transitions. Word has length 58 [2022-11-25 23:56:12,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:12,927 INFO L495 AbstractCegarLoop]: Abstraction has 7975 states and 34941 transitions. [2022-11-25 23:56:12,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:12,927 INFO L276 IsEmpty]: Start isEmpty. Operand 7975 states and 34941 transitions. [2022-11-25 23:56:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:56:12,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:12,942 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:12,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 23:56:13,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:13,143 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:56:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:13,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1481044152, now seen corresponding path program 2 times [2022-11-25 23:56:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:13,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29679278] [2022-11-25 23:56:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:14,327 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-25 23:56:14,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:14,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29679278] [2022-11-25 23:56:14,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29679278] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:14,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202067843] [2022-11-25 23:56:14,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:56:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:14,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:14,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:14,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 23:56:14,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:56:14,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:56:14,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 23:56:14,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:14,619 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-25 23:56:14,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-25 23:56:14,725 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 23:56:14,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-25 23:56:14,820 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-25 23:56:14,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 23:56:15,150 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-25 23:56:15,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 22 [2022-11-25 23:56:15,267 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 23:56:15,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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-25 23:56:15,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:15,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:15,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:56:16,029 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-25 23:56:16,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:16,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:16,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-25 23:56:16,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 162 [2022-11-25 23:56:16,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 134 [2022-11-25 23:56:16,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:16,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:56:16,704 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-25 23:56:16,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-25 23:56:17,536 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-25 23:56:17,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202067843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:56:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1132888425] [2022-11-25 23:56:17,537 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-25 23:56:17,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:56:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 29 [2022-11-25 23:56:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512979759] [2022-11-25 23:56:17,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:56:17,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:56:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:56:17,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:56:17,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=798, Unknown=17, NotChecked=0, Total=930 [2022-11-25 23:56:17,542 INFO L87 Difference]: Start difference. First operand 7975 states and 34941 transitions. Second operand has 31 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:22,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:56:22,436 INFO L93 Difference]: Finished difference Result 12630 states and 56384 transitions. [2022-11-25 23:56:22,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-25 23:56:22,437 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-25 23:56:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:56:22,477 INFO L225 Difference]: With dead ends: 12630 [2022-11-25 23:56:22,477 INFO L226 Difference]: Without dead ends: 11881 [2022-11-25 23:56:22,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 91 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=492, Invalid=2140, Unknown=20, NotChecked=0, Total=2652 [2022-11-25 23:56:22,478 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1118 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:56:22,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 644 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-25 23:56:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11881 states. [2022-11-25 23:56:22,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11881 to 8087. [2022-11-25 23:56:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8087 states, 8086 states have (on average 4.390427900074203) internal successors, (35501), 8086 states have internal predecessors, (35501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8087 states to 8087 states and 35501 transitions. [2022-11-25 23:56:22,697 INFO L78 Accepts]: Start accepts. Automaton has 8087 states and 35501 transitions. Word has length 58 [2022-11-25 23:56:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:56:22,698 INFO L495 AbstractCegarLoop]: Abstraction has 8087 states and 35501 transitions. [2022-11-25 23:56:22,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.0) internal successors, (120), 30 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:56:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8087 states and 35501 transitions. [2022-11-25 23:56:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 23:56:22,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:56:22,716 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:56:22,721 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 23:56:22,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 23:56:22,917 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-25 23:56:22,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:56:22,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1359016328, now seen corresponding path program 3 times [2022-11-25 23:56:22,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:56:22,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083078414] [2022-11-25 23:56:22,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:56:22,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:56:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:56:24,149 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-25 23:56:24,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:56:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083078414] [2022-11-25 23:56:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083078414] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:56:24,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219494863] [2022-11-25 23:56:24,150 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:56:24,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:56:24,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:56:24,151 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:56:24,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b8865669-b5d2-43a1-b67e-4b5eb5fd2969/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 23:56:24,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:56:24,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:56:24,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-25 23:56:24,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:56:24,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 23:56:24,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:56:24,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:56:24,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:56:25,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 23:56:25,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:25,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:25,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:56:25,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 23:56:25,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 23:56:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:56:25,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:56:26,436 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))))) (and (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (<= (+ c_~s_6~0 .cse0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1) c_~s_2~0))) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1) c_~s_2~0) (+ c_~s_6~0 .cse0 1))))) is different from false [2022-11-25 23:56:26,497 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1197))) (<= (+ c_~s_6~0 (select (select .cse0 c_~X_0~0.base) .cse1)) (+ (select (select (store (store .cse0 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0)))) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1197))) (< (+ (select (select (store (store .cse3 |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0) (+ c_~s_6~0 (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))) is different from false [2022-11-25 23:56:26,560 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1197))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0)))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_1197))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)))))) is different from false [2022-11-25 23:56:28,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0)))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)))))) is different from false [2022-11-25 23:56:28,698 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (< (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select .cse3 c_~X_0~0.base) .cse1) 1)))))))))) is different from false [2022-11-25 23:56:28,799 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (< (+ (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1) c_~s_2~0) (+ (select (select .cse0 c_~X_0~0.base) .cse2) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (<= (select (select .cse3 c_~X_0~0.base) .cse2) (+ (select (select (store (store .cse3 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1) c_~s_2~0)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)))))) is different from false [2022-11-25 23:56:28,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)) (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (<= (select (select .cse0 c_~X_0~0.base) .cse1) (select (select (store (store .cse0 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1)))))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_117| Int) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_117|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_119| Int)) (or (forall ((v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1198 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_1195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1196) |v_thread4Thread1of1ForFork0_~#t5~0.base_117| v_ArrVal_1197))) (< (select (select (store (store .cse2 |v_thread4Thread1of1ForFork0_~#t6~0.base_119| v_ArrVal_1198) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1199) c_~X_0~0.base) .cse1) (+ (select (select .cse2 c_~X_0~0.base) .cse1) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_119|)))))))) is different from false [2022-11-25 23:56:45,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:56:45,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 58 [2022-11-25 23:56:45,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 165014 treesize of output 161270 [2022-11-25 23:56:54,123 WARN L233 SmtUtils]: Spent 8.21s on a formula simplification. DAG size of input: 368 DAG size of output: 364 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 23:56:54,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158006 treesize of output 141622 [2022-11-25 23:56:54,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141622 treesize of output 133430 [2022-11-25 23:56:55,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133430 treesize of output 124214 [2022-11-25 23:56:56,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124214 treesize of output 107830 [2022-11-25 23:56:56,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107830 treesize of output 102966 [2022-11-25 23:56:57,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102966 treesize of output 100470