./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh --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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 13:08:39,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 13:08:39,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 13:08:39,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 13:08:39,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 13:08:39,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 13:08:39,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 13:08:39,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 13:08:39,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 13:08:39,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 13:08:39,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 13:08:39,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 13:08:39,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 13:08:39,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 13:08:39,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 13:08:39,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 13:08:39,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 13:08:39,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 13:08:39,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 13:08:39,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 13:08:39,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 13:08:39,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 13:08:39,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 13:08:39,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 13:08:39,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 13:08:39,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 13:08:39,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 13:08:39,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 13:08:39,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 13:08:39,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 13:08:39,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 13:08:39,903 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 13:08:39,904 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 13:08:39,904 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 13:08:39,905 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 13:08:39,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 13:08:39,906 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 13:08:39,906 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 13:08:39,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 13:08:39,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 13:08:39,908 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 13:08:39,909 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 13:08:39,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 13:08:39,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 13:08:39,931 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 13:08:39,931 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 13:08:39,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 13:08:39,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 13:08:39,932 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 13:08:39,933 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 13:08:39,933 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 13:08:39,933 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 13:08:39,933 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 13:08:39,933 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 13:08:39,934 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 13:08:39,934 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 13:08:39,934 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 13:08:39,934 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 13:08:39,934 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 13:08:39,935 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 13:08:39,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 13:08:39,935 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 13:08:39,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 13:08:39,937 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 13:08:39,937 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 13:08:39,937 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 13:08:39,937 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 13:08:39,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 13:08:39,938 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:08:39,938 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 13:08:39,938 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 13:08:39,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 13:08:39,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 13:08:39,938 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 13:08:39,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 13:08:39,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 13:08:39,939 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 13:08:39,939 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_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-12-14 13:08:40,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 13:08:40,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 13:08:40,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 13:08:40,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 13:08:40,145 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 13:08:40,145 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-12-14 13:08:42,745 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 13:08:42,875 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 13:08:42,875 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-12-14 13:08:42,880 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/data/f4ea911d1/c09c187fca284747962b5215a0ef820b/FLAG4db0fecce [2022-12-14 13:08:42,889 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/data/f4ea911d1/c09c187fca284747962b5215a0ef820b [2022-12-14 13:08:42,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 13:08:42,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 13:08:42,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 13:08:42,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 13:08:42,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 13:08:42,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:08:42" (1/1) ... [2022-12-14 13:08:42,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51649e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:42, skipping insertion in model container [2022-12-14 13:08:42,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 01:08:42" (1/1) ... [2022-12-14 13:08:42,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 13:08:42,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 13:08:43,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,031 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,033 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,034 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,035 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,041 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_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-12-14 13:08:43,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:08:43,055 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 13:08:43,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,067 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 13:08:43,068 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 13:08:43,071 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_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-12-14 13:08:43,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 13:08:43,083 INFO L208 MainTranslator]: Completed translation [2022-12-14 13:08:43,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43 WrapperNode [2022-12-14 13:08:43,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 13:08:43,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 13:08:43,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 13:08:43,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 13:08:43,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,112 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-12-14 13:08:43,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 13:08:43,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 13:08:43,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 13:08:43,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 13:08:43,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,132 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 13:08:43,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 13:08:43,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 13:08:43,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 13:08:43,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (1/1) ... [2022-12-14 13:08:43,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 13:08:43,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:43,161 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 13:08:43,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 13:08:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 13:08:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 13:08:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 13:08:43,197 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 13:08:43,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 13:08:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 13:08:43,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 13:08:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 13:08:43,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 13:08:43,199 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 13:08:43,293 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 13:08:43,295 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 13:08:43,514 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 13:08:43,559 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 13:08:43,559 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 13:08:43,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:08:43 BoogieIcfgContainer [2022-12-14 13:08:43,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 13:08:43,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 13:08:43,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 13:08:43,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 13:08:43,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 01:08:42" (1/3) ... [2022-12-14 13:08:43,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5386e075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:08:43, skipping insertion in model container [2022-12-14 13:08:43,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 01:08:43" (2/3) ... [2022-12-14 13:08:43,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5386e075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 01:08:43, skipping insertion in model container [2022-12-14 13:08:43,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 01:08:43" (3/3) ... [2022-12-14 13:08:43,567 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-12-14 13:08:43,574 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 13:08:43,582 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 13:08:43,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 13:08:43,583 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 13:08:43,640 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 13:08:43,682 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 13:08:43,697 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 154 transitions, 332 flow [2022-12-14 13:08:43,700 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 154 transitions, 332 flow [2022-12-14 13:08:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-12-14 13:08:43,753 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-12-14 13:08:43,753 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 13:08:43,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 12/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-12-14 13:08:43,758 INFO L119 LiptonReduction]: Number of co-enabled transitions 1320 [2022-12-14 13:08:48,336 INFO L134 LiptonReduction]: Checked pairs total: 1529 [2022-12-14 13:08:48,336 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-12-14 13:08:48,342 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 28 transitions, 80 flow [2022-12-14 13:08:48,357 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:48,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 13:08:48,374 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;@610a00ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 13:08:48,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 13:08:48,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 13:08:48,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:48,381 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] [2022-12-14 13:08:48,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:48,385 INFO L85 PathProgramCache]: Analyzing trace with hash 233095304, now seen corresponding path program 1 times [2022-12-14 13:08:48,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849169975] [2022-12-14 13:08:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:48,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:48,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:48,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849169975] [2022-12-14 13:08:48,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849169975] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:08:48,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:08:48,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 13:08:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307783603] [2022-12-14 13:08:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:08:48,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 13:08:48,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:48,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 13:08:48,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:08:48,813 INFO L87 Difference]: Start difference. First operand has 107 states, 106 states have (on average 3.0849056603773586) internal successors, (327), 106 states have internal predecessors, (327), 0 states have call successors, (0), 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 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:48,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:48,873 INFO L93 Difference]: Finished difference Result 204 states and 632 transitions. [2022-12-14 13:08:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:08:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-12-14 13:08:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:48,883 INFO L225 Difference]: With dead ends: 204 [2022-12-14 13:08:48,883 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 13:08:48,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 13:08:48,886 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:48,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:08:48,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 13:08:48,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-12-14 13:08:48,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 196 states have (on average 3.13265306122449) internal successors, (614), 196 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 614 transitions. [2022-12-14 13:08:48,921 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 614 transitions. Word has length 20 [2022-12-14 13:08:48,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:48,922 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 614 transitions. [2022-12-14 13:08:48,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 614 transitions. [2022-12-14 13:08:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 13:08:48,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:48,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:08:48,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 13:08:48,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:48,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash 949100386, now seen corresponding path program 1 times [2022-12-14 13:08:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:48,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088047449] [2022-12-14 13:08:48,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:49,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:49,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088047449] [2022-12-14 13:08:49,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088047449] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 13:08:49,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 13:08:49,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 13:08:49,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198440373] [2022-12-14 13:08:49,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:08:49,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:08:49,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:08:49,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:08:49,016 INFO L87 Difference]: Start difference. First operand 197 states and 614 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:49,076 INFO L93 Difference]: Finished difference Result 198 states and 615 transitions. [2022-12-14 13:08:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 13:08:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 13:08:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:49,079 INFO L225 Difference]: With dead ends: 198 [2022-12-14 13:08:49,079 INFO L226 Difference]: Without dead ends: 198 [2022-12-14 13:08:49,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 13:08:49,080 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:49,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:08:49,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-12-14 13:08:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2022-12-14 13:08:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 3.1218274111675126) internal successors, (615), 197 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 615 transitions. [2022-12-14 13:08:49,090 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 615 transitions. Word has length 21 [2022-12-14 13:08:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:49,091 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 615 transitions. [2022-12-14 13:08:49,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 615 transitions. [2022-12-14 13:08:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:08:49,092 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:49,092 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] [2022-12-14 13:08:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 13:08:49,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1984248252, now seen corresponding path program 1 times [2022-12-14 13:08:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684177580] [2022-12-14 13:08:49,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:49,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:49,200 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684177580] [2022-12-14 13:08:49,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684177580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:49,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409361725] [2022-12-14 13:08:49,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:49,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:49,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:08:49,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 13:08:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:49,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:08:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:08:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:49,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:08:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:49,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409361725] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:49,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:08:49,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-12-14 13:08:49,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446726663] [2022-12-14 13:08:49,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:08:49,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 13:08:49,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:49,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 13:08:49,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-12-14 13:08:49,440 INFO L87 Difference]: Start difference. First operand 198 states and 615 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:49,562 INFO L93 Difference]: Finished difference Result 202 states and 625 transitions. [2022-12-14 13:08:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:08:49,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:08:49,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:49,565 INFO L225 Difference]: With dead ends: 202 [2022-12-14 13:08:49,565 INFO L226 Difference]: Without dead ends: 202 [2022-12-14 13:08:49,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2022-12-14 13:08:49,566 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 81 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:49,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 11 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 13:08:49,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-12-14 13:08:49,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 134. [2022-12-14 13:08:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 3.1052631578947367) internal successors, (413), 133 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 413 transitions. [2022-12-14 13:08:49,578 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 413 transitions. Word has length 22 [2022-12-14 13:08:49,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:49,578 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 413 transitions. [2022-12-14 13:08:49,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 413 transitions. [2022-12-14 13:08:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-14 13:08:49,580 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:49,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:08:49,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 13:08:49,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:49,781 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash -157164904, now seen corresponding path program 1 times [2022-12-14 13:08:49,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:49,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663559268] [2022-12-14 13:08:49,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:49,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:49,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:49,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:49,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663559268] [2022-12-14 13:08:49,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663559268] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:49,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536938641] [2022-12-14 13:08:49,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:49,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:49,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:49,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:08:49,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 13:08:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:49,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 13:08:49,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:08:49,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:49,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:08:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:50,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536938641] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:50,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-14 13:08:50,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2022-12-14 13:08:50,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567536540] [2022-12-14 13:08:50,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 13:08:50,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 13:08:50,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:50,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 13:08:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-12-14 13:08:50,013 INFO L87 Difference]: Start difference. First operand 134 states and 413 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:50,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:50,062 INFO L93 Difference]: Finished difference Result 166 states and 519 transitions. [2022-12-14 13:08:50,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 13:08:50,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-14 13:08:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:50,064 INFO L225 Difference]: With dead ends: 166 [2022-12-14 13:08:50,064 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 13:08:50,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-14 13:08:50,065 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 28 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:50,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 7 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 13:08:50,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 13:08:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-12-14 13:08:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 3.1454545454545455) internal successors, (519), 165 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:50,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 519 transitions. [2022-12-14 13:08:50,076 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 519 transitions. Word has length 22 [2022-12-14 13:08:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:50,076 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 519 transitions. [2022-12-14 13:08:50,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 519 transitions. [2022-12-14 13:08:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:08:50,077 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:50,078 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] [2022-12-14 13:08:50,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 13:08:50,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:50,278 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:50,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:50,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1553821066, now seen corresponding path program 1 times [2022-12-14 13:08:50,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:50,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454309138] [2022-12-14 13:08:50,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:51,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454309138] [2022-12-14 13:08:51,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454309138] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:51,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302235548] [2022-12-14 13:08:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:51,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:51,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:51,392 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:08:51,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 13:08:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:51,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 13:08:51,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:08:51,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:08:51,803 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 35 treesize of output 33 [2022-12-14 13:08:51,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:08:51,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:51,952 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 66 treesize of output 39 [2022-12-14 13:08:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:52,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:08:52,381 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (or (= c_~max1~0 .cse0) (not (< c_~max3~0 .cse0)) (<= .cse0 c_~max2~0)))) (or (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (or (< c_~max2~0 .cse2) (not (< c_~max3~0 .cse2))))) .cse3) (or (forall ((v_ArrVal_173 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))))) is different from false [2022-12-14 13:08:52,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:52,463 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 249 treesize of output 189 [2022-12-14 13:08:52,478 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 148 [2022-12-14 13:08:52,486 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 148 treesize of output 136 [2022-12-14 13:08:52,494 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 136 treesize of output 118 [2022-12-14 13:08:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-14 13:08:53,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302235548] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:08:53,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [364268771] [2022-12-14 13:08:53,033 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:08:53,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:08:53,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 28 [2022-12-14 13:08:53,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182554716] [2022-12-14 13:08:53,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:08:53,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-14 13:08:53,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-14 13:08:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=687, Unknown=1, NotChecked=54, Total=870 [2022-12-14 13:08:53,037 INFO L87 Difference]: Start difference. First operand 166 states and 519 transitions. Second operand has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:54,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:54,564 INFO L93 Difference]: Finished difference Result 454 states and 1378 transitions. [2022-12-14 13:08:54,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 13:08:54,565 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:08:54,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:54,566 INFO L225 Difference]: With dead ends: 454 [2022-12-14 13:08:54,566 INFO L226 Difference]: Without dead ends: 440 [2022-12-14 13:08:54,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=326, Invalid=1569, Unknown=1, NotChecked=84, Total=1980 [2022-12-14 13:08:54,567 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 236 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:54,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 104 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1077 Invalid, 0 Unknown, 108 Unchecked, 0.7s Time] [2022-12-14 13:08:54,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-12-14 13:08:54,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 288. [2022-12-14 13:08:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 3.1707317073170733) internal successors, (910), 287 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 910 transitions. [2022-12-14 13:08:54,577 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 910 transitions. Word has length 23 [2022-12-14 13:08:54,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:54,577 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 910 transitions. [2022-12-14 13:08:54,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:54,577 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 910 transitions. [2022-12-14 13:08:54,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:08:54,578 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:54,578 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] [2022-12-14 13:08:54,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 13:08:54,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:54,779 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:54,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash -749909942, now seen corresponding path program 2 times [2022-12-14 13:08:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:54,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280289828] [2022-12-14 13:08:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:54,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:55,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:55,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280289828] [2022-12-14 13:08:55,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280289828] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:55,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662179638] [2022-12-14 13:08:55,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:08:55,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:55,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:55,414 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:08:55,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 13:08:55,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:08:55,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:08:55,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-14 13:08:55,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:08:55,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:08:55,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:55,737 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 66 treesize of output 39 [2022-12-14 13:08:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:55,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:08:55,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:55,978 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 127 treesize of output 75 [2022-12-14 13:08:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:56,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662179638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:08:56,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1735074719] [2022-12-14 13:08:56,301 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:08:56,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:08:56,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-12-14 13:08:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630165908] [2022-12-14 13:08:56,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:08:56,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 13:08:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:56,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 13:08:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-12-14 13:08:56,304 INFO L87 Difference]: Start difference. First operand 288 states and 910 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:57,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:08:57,467 INFO L93 Difference]: Finished difference Result 403 states and 1258 transitions. [2022-12-14 13:08:57,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 13:08:57,467 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:08:57,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:08:57,469 INFO L225 Difference]: With dead ends: 403 [2022-12-14 13:08:57,469 INFO L226 Difference]: Without dead ends: 396 [2022-12-14 13:08:57,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 13:08:57,470 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 184 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:08:57,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 66 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:08:57,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-12-14 13:08:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 294. [2022-12-14 13:08:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 3.1706484641638224) internal successors, (929), 293 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 929 transitions. [2022-12-14 13:08:57,478 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 929 transitions. Word has length 23 [2022-12-14 13:08:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:08:57,478 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 929 transitions. [2022-12-14 13:08:57,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:08:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 929 transitions. [2022-12-14 13:08:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:08:57,479 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:08:57,479 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] [2022-12-14 13:08:57,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 13:08:57,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 13:08:57,681 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:08:57,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:08:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 845544290, now seen corresponding path program 3 times [2022-12-14 13:08:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:08:57,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781517134] [2022-12-14 13:08:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:08:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:08:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:08:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:08:58,199 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:08:58,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781517134] [2022-12-14 13:08:58,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781517134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:08:58,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142369019] [2022-12-14 13:08:58,200 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:08:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:08:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:08:58,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:08:58,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 13:08:58,280 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:08:58,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:08:58,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 13:08:58,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:08:58,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:58,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 81 [2022-12-14 13:08:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:58,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:08:58,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:08:58,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 119 treesize of output 75 [2022-12-14 13:08:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:08:59,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142369019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:08:59,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [102579773] [2022-12-14 13:08:59,225 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:08:59,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:08:59,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 26 [2022-12-14 13:08:59,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768865033] [2022-12-14 13:08:59,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:08:59,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 13:08:59,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:08:59,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 13:08:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2022-12-14 13:08:59,226 INFO L87 Difference]: Start difference. First operand 294 states and 929 transitions. Second operand has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:00,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:00,390 INFO L93 Difference]: Finished difference Result 543 states and 1472 transitions. [2022-12-14 13:09:00,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-14 13:09:00,390 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:00,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:00,392 INFO L225 Difference]: With dead ends: 543 [2022-12-14 13:09:00,392 INFO L226 Difference]: Without dead ends: 522 [2022-12-14 13:09:00,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=1732, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 13:09:00,393 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 198 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:00,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 36 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 13:09:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-12-14 13:09:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 320. [2022-12-14 13:09:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 319 states have (on average 3.188087774294671) internal successors, (1017), 319 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 1017 transitions. [2022-12-14 13:09:00,401 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 1017 transitions. Word has length 23 [2022-12-14 13:09:00,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:00,402 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 1017 transitions. [2022-12-14 13:09:00,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.5555555555555554) internal successors, (69), 27 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:00,402 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 1017 transitions. [2022-12-14 13:09:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:00,402 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:00,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:09:00,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 13:09:00,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 13:09:00,604 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:00,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:00,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2099058058, now seen corresponding path program 4 times [2022-12-14 13:09:00,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:00,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814510379] [2022-12-14 13:09:00,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:00,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:01,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:01,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814510379] [2022-12-14 13:09:01,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814510379] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419161836] [2022-12-14 13:09:01,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:09:01,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:01,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:01,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:01,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 13:09:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:01,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:09:01,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:01,499 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 55 treesize of output 31 [2022-12-14 13:09:01,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:01,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:01,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:01,749 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 119 treesize of output 75 [2022-12-14 13:09:02,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:02,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419161836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:02,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000184088] [2022-12-14 13:09:02,039 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:02,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:02,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-12-14 13:09:02,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46785209] [2022-12-14 13:09:02,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:02,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 13:09:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 13:09:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2022-12-14 13:09:02,041 INFO L87 Difference]: Start difference. First operand 320 states and 1017 transitions. Second operand has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:02,751 INFO L93 Difference]: Finished difference Result 417 states and 1310 transitions. [2022-12-14 13:09:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 13:09:02,751 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:02,755 INFO L225 Difference]: With dead ends: 417 [2022-12-14 13:09:02,755 INFO L226 Difference]: Without dead ends: 410 [2022-12-14 13:09:02,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=311, Invalid=1095, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 13:09:02,756 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 148 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:02,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 53 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:09:02,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-12-14 13:09:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 332. [2022-12-14 13:09:02,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.199395770392749) internal successors, (1059), 331 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1059 transitions. [2022-12-14 13:09:02,763 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 1059 transitions. Word has length 23 [2022-12-14 13:09:02,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:02,763 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 1059 transitions. [2022-12-14 13:09:02,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.875) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:02,764 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 1059 transitions. [2022-12-14 13:09:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:02,764 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:02,764 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] [2022-12-14 13:09:02,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 13:09:02,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 13:09:02,966 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:02,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:02,967 INFO L85 PathProgramCache]: Analyzing trace with hash 655120210, now seen corresponding path program 5 times [2022-12-14 13:09:02,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:02,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72829462] [2022-12-14 13:09:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:03,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:03,565 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72829462] [2022-12-14 13:09:03,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72829462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:03,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280992064] [2022-12-14 13:09:03,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:09:03,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:03,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:03,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:03,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 13:09:03,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:09:03,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:09:03,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:09:03,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:03,878 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 55 treesize of output 31 [2022-12-14 13:09:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:03,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:04,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:04,159 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 103 treesize of output 73 [2022-12-14 13:09:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280992064] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:04,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [298343117] [2022-12-14 13:09:04,461 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:04,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:04,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2022-12-14 13:09:04,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325416154] [2022-12-14 13:09:04,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 13:09:04,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:04,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 13:09:04,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-12-14 13:09:04,463 INFO L87 Difference]: Start difference. First operand 332 states and 1059 transitions. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:05,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:05,251 INFO L93 Difference]: Finished difference Result 449 states and 1432 transitions. [2022-12-14 13:09:05,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 13:09:05,251 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:05,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:05,253 INFO L225 Difference]: With dead ends: 449 [2022-12-14 13:09:05,253 INFO L226 Difference]: Without dead ends: 442 [2022-12-14 13:09:05,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=245, Invalid=945, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 13:09:05,253 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 135 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:05,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 97 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:09:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-12-14 13:09:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 354. [2022-12-14 13:09:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 3.1926345609065154) internal successors, (1127), 353 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:05,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1127 transitions. [2022-12-14 13:09:05,261 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1127 transitions. Word has length 23 [2022-12-14 13:09:05,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:05,261 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 1127 transitions. [2022-12-14 13:09:05,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 23 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1127 transitions. [2022-12-14 13:09:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:05,262 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:05,262 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] [2022-12-14 13:09:05,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 13:09:05,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:05,464 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2068324688, now seen corresponding path program 6 times [2022-12-14 13:09:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:05,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972629254] [2022-12-14 13:09:05,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:06,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972629254] [2022-12-14 13:09:06,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972629254] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:06,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239559259] [2022-12-14 13:09:06,020 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:09:06,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:06,021 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:06,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 13:09:06,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:09:06,097 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:09:06,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-14 13:09:06,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:06,370 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:09:06,372 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:06,372 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 66 treesize of output 39 [2022-12-14 13:09:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:09:06,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:06,582 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:06,583 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 127 treesize of output 75 [2022-12-14 13:09:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:09:06,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239559259] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:06,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1838200488] [2022-12-14 13:09:06,856 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:06,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:06,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2022-12-14 13:09:06,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203191920] [2022-12-14 13:09:06,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:06,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 13:09:06,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:06,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 13:09:06,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2022-12-14 13:09:06,858 INFO L87 Difference]: Start difference. First operand 354 states and 1127 transitions. Second operand has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:07,567 INFO L93 Difference]: Finished difference Result 427 states and 1336 transitions. [2022-12-14 13:09:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:09:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:07,568 INFO L225 Difference]: With dead ends: 427 [2022-12-14 13:09:07,569 INFO L226 Difference]: Without dead ends: 420 [2022-12-14 13:09:07,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=947, Unknown=0, NotChecked=0, Total=1190 [2022-12-14 13:09:07,569 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:07,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 59 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:09:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-12-14 13:09:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 358. [2022-12-14 13:09:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.1848739495798317) internal successors, (1137), 357 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2022-12-14 13:09:07,576 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 23 [2022-12-14 13:09:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:07,576 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2022-12-14 13:09:07,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6538461538461537) internal successors, (69), 26 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2022-12-14 13:09:07,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:07,577 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:07,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:09:07,582 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 13:09:07,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:07,779 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:07,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash -631188376, now seen corresponding path program 7 times [2022-12-14 13:09:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:07,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297429754] [2022-12-14 13:09:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:08,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:08,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297429754] [2022-12-14 13:09:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297429754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737921310] [2022-12-14 13:09:08,271 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:09:08,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:08,272 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:08,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 13:09:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:08,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:09:08,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:08,630 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-12-14 13:09:08,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-12-14 13:09:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:08,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:08,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:08,850 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 119 treesize of output 75 [2022-12-14 13:09:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:09,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737921310] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:09,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1482218429] [2022-12-14 13:09:09,124 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:09,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:09,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2022-12-14 13:09:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195795434] [2022-12-14 13:09:09,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:09,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 13:09:09,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:09,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 13:09:09,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-12-14 13:09:09,127 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:09,980 INFO L93 Difference]: Finished difference Result 486 states and 1517 transitions. [2022-12-14 13:09:09,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-14 13:09:09,980 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:09,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:09,984 INFO L225 Difference]: With dead ends: 486 [2022-12-14 13:09:09,984 INFO L226 Difference]: Without dead ends: 472 [2022-12-14 13:09:09,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=348, Invalid=1134, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 13:09:09,985 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 137 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:09,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 79 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:09:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-14 13:09:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 358. [2022-12-14 13:09:09,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 3.1848739495798317) internal successors, (1137), 357 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 1137 transitions. [2022-12-14 13:09:09,993 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 1137 transitions. Word has length 23 [2022-12-14 13:09:09,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:09,994 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 1137 transitions. [2022-12-14 13:09:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 1137 transitions. [2022-12-14 13:09:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:09,995 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:09,995 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] [2022-12-14 13:09:09,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 13:09:10,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 13:09:10,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:10,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash -769045878, now seen corresponding path program 8 times [2022-12-14 13:09:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:10,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315559360] [2022-12-14 13:09:10,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:10,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:10,713 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:10,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315559360] [2022-12-14 13:09:10,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315559360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029490274] [2022-12-14 13:09:10,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:09:10,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:10,714 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:10,715 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:10,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 13:09:10,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:09:10,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:09:10,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 13:09:10,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:10,987 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:09:10,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:10,989 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 66 treesize of output 39 [2022-12-14 13:09:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:11,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:11,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:11,214 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 127 treesize of output 75 [2022-12-14 13:09:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:11,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029490274] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:11,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781223284] [2022-12-14 13:09:11,561 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:11,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:11,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2022-12-14 13:09:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725651540] [2022-12-14 13:09:11,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:11,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 13:09:11,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:11,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 13:09:11,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-12-14 13:09:11,563 INFO L87 Difference]: Start difference. First operand 358 states and 1137 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:12,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:12,602 INFO L93 Difference]: Finished difference Result 521 states and 1620 transitions. [2022-12-14 13:09:12,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-14 13:09:12,602 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:12,604 INFO L225 Difference]: With dead ends: 521 [2022-12-14 13:09:12,604 INFO L226 Difference]: Without dead ends: 514 [2022-12-14 13:09:12,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=313, Invalid=1247, Unknown=0, NotChecked=0, Total=1560 [2022-12-14 13:09:12,605 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 151 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:12,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 87 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:09:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-14 13:09:12,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 356. [2022-12-14 13:09:12,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 3.1887323943661974) internal successors, (1132), 355 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 1132 transitions. [2022-12-14 13:09:12,616 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 1132 transitions. Word has length 23 [2022-12-14 13:09:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:12,617 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 1132 transitions. [2022-12-14 13:09:12,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:12,617 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 1132 transitions. [2022-12-14 13:09:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:12,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:12,617 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] [2022-12-14 13:09:12,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-14 13:09:12,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 13:09:12,819 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash 761017304, now seen corresponding path program 9 times [2022-12-14 13:09:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:12,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180608715] [2022-12-14 13:09:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:13,505 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:13,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180608715] [2022-12-14 13:09:13,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180608715] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:13,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336402066] [2022-12-14 13:09:13,505 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:09:13,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:13,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:13,506 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:13,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 13:09:13,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:09:13,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:09:13,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 13:09:13,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:13,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:09:13,796 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 35 treesize of output 33 [2022-12-14 13:09:13,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:09:13,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 35 treesize of output 33 [2022-12-14 13:09:14,086 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:09:14,088 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:14,088 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 66 treesize of output 39 [2022-12-14 13:09:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:09:14,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:09:14,410 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse1) (not (< c_~max3~0 .cse1)))))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse2))) (or (<= .cse3 c_~max2~0) (not (< c_~max3~0 .cse3)) (= c_~max1~0 .cse3)))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_527 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse2)))))) is different from false [2022-12-14 13:09:15,447 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:15,447 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 879 treesize of output 779 [2022-12-14 13:09:15,458 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 744 treesize of output 720 [2022-12-14 13:09:15,467 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 720 treesize of output 708 [2022-12-14 13:09:15,476 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 708 treesize of output 702 [2022-12-14 13:09:15,489 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 702 treesize of output 654 [2022-12-14 13:09:15,498 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 654 treesize of output 582 [2022-12-14 13:09:15,506 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 582 treesize of output 546 [2022-12-14 13:09:16,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:09:16,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336402066] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:09:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1629520109] [2022-12-14 13:09:16,001 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:09:16,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:09:16,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2022-12-14 13:09:16,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916374604] [2022-12-14 13:09:16,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:09:16,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 13:09:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:09:16,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 13:09:16,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=752, Unknown=2, NotChecked=56, Total=930 [2022-12-14 13:09:16,003 INFO L87 Difference]: Start difference. First operand 356 states and 1132 transitions. Second operand has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:30,087 WARN L233 SmtUtils]: Spent 12.48s on a formula simplification. DAG size of input: 88 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:09:30,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_~max1~0 c_~max2~0))) (let ((.cse8 (and (or .cse6 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))) (.cse5 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse0 (or .cse6 (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse10 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))) (or (< c_~max2~0 .cse10) (not (< c_~max3~0 .cse10))))))) (.cse1 (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse9 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))) (or (<= .cse9 c_~max2~0) (not (< c_~max3~0 .cse9)) (= c_~max1~0 .cse9))))) (.cse2 (or .cse8 (forall ((v_ArrVal_527 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))))) (.cse3 (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0))) (and (or (and .cse0 .cse1 .cse2) .cse3) .cse0 .cse1 .cse2 (or (and (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_527 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))) (or (not (< c_~max3~0 .cse4)) (= c_~max1~0 .cse4) (<= .cse4 c_~max2~0)))) (or .cse6 (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_527 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))) (or (not (< c_~max3~0 .cse7)) (< c_~max2~0 .cse7))))) (or (forall ((v_ArrVal_526 (Array Int Int)) (v_ArrVal_527 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_526) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_527) c_~A~0.base) .cse5))) .cse8)) .cse3))))) is different from false [2022-12-14 13:09:44,151 WARN L233 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 99 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:09:56,942 WARN L233 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 89 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:09:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:09:57,747 INFO L93 Difference]: Finished difference Result 953 states and 2840 transitions. [2022-12-14 13:09:57,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 13:09:57,747 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:09:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:09:57,751 INFO L225 Difference]: With dead ends: 953 [2022-12-14 13:09:57,751 INFO L226 Difference]: Without dead ends: 930 [2022-12-14 13:09:57,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 41.4s TimeCoverageRelationStatistics Valid=539, Invalid=2886, Unknown=5, NotChecked=230, Total=3660 [2022-12-14 13:09:57,753 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 270 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 41 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 13:09:57,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 102 Invalid, 2258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2078 Invalid, 4 Unknown, 135 Unchecked, 1.8s Time] [2022-12-14 13:09:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2022-12-14 13:09:57,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 415. [2022-12-14 13:09:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 414 states have (on average 3.2681159420289854) internal successors, (1353), 414 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1353 transitions. [2022-12-14 13:09:57,770 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1353 transitions. Word has length 23 [2022-12-14 13:09:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:09:57,770 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 1353 transitions. [2022-12-14 13:09:57,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.3) internal successors, (69), 30 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:09:57,770 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1353 transitions. [2022-12-14 13:09:57,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 13:09:57,772 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:09:57,772 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] [2022-12-14 13:09:57,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 13:09:57,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 13:09:57,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:09:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:09:57,973 INFO L85 PathProgramCache]: Analyzing trace with hash -302678576, now seen corresponding path program 10 times [2022-12-14 13:09:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:09:57,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605011725] [2022-12-14 13:09:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:09:57,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:09:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:58,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:58,743 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:09:58,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605011725] [2022-12-14 13:09:58,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605011725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:09:58,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867874165] [2022-12-14 13:09:58,743 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:09:58,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:09:58,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:09:58,744 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:09:58,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 13:09:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:09:58,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 13:09:58,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:09:59,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:09:59,084 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 35 treesize of output 33 [2022-12-14 13:09:59,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:09:59,199 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 35 treesize of output 33 [2022-12-14 13:09:59,372 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:09:59,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:09:59,375 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 66 treesize of output 39 [2022-12-14 13:09:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:09:59,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:00,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:00,115 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 957 treesize of output 849 [2022-12-14 13:10:00,124 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 814 treesize of output 766 [2022-12-14 13:10:00,133 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 766 treesize of output 742 [2022-12-14 13:10:00,142 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 742 treesize of output 670 [2022-12-14 13:10:00,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 670 treesize of output 634 [2022-12-14 13:10:00,165 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 634 treesize of output 622 [2022-12-14 13:10:00,178 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 622 treesize of output 598 [2022-12-14 13:10:01,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:10:01,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867874165] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:01,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [3434140] [2022-12-14 13:10:01,014 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:01,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:01,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2022-12-14 13:10:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663121674] [2022-12-14 13:10:01,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:01,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 13:10:01,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:01,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 13:10:01,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=647, Unknown=6, NotChecked=0, Total=756 [2022-12-14 13:10:01,016 INFO L87 Difference]: Start difference. First operand 415 states and 1353 transitions. Second operand has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:07,933 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 75 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:10:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:08,310 INFO L93 Difference]: Finished difference Result 624 states and 2000 transitions. [2022-12-14 13:10:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 13:10:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 13:10:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:08,313 INFO L225 Difference]: With dead ends: 624 [2022-12-14 13:10:08,313 INFO L226 Difference]: Without dead ends: 617 [2022-12-14 13:10:08,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=184, Invalid=1000, Unknown=6, NotChecked=0, Total=1190 [2022-12-14 13:10:08,313 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 199 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:08,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 86 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 13:10:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2022-12-14 13:10:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 416. [2022-12-14 13:10:08,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 3.2674698795180723) internal successors, (1356), 415 states have internal predecessors, (1356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1356 transitions. [2022-12-14 13:10:08,322 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1356 transitions. Word has length 23 [2022-12-14 13:10:08,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:08,322 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 1356 transitions. [2022-12-14 13:10:08,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:08,322 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1356 transitions. [2022-12-14 13:10:08,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:10:08,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:08,323 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:08,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 13:10:08,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 13:10:08,525 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:08,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash -152174436, now seen corresponding path program 11 times [2022-12-14 13:10:08,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:08,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937042570] [2022-12-14 13:10:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:10:08,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:08,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937042570] [2022-12-14 13:10:08,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937042570] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:08,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937373020] [2022-12-14 13:10:08,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:08,605 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:08,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 13:10:08,679 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:08,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:08,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:08,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:08,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:08,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937373020] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1598810430] [2022-12-14 13:10:08,823 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:08,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:08,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2022-12-14 13:10:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025320039] [2022-12-14 13:10:08,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:10:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:10:08,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:08,825 INFO L87 Difference]: Start difference. First operand 416 states and 1356 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:09,285 INFO L93 Difference]: Finished difference Result 790 states and 2475 transitions. [2022-12-14 13:10:09,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 13:10:09,285 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:10:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:09,288 INFO L225 Difference]: With dead ends: 790 [2022-12-14 13:10:09,288 INFO L226 Difference]: Without dead ends: 790 [2022-12-14 13:10:09,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=340, Invalid=782, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 13:10:09,289 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 183 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:09,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 72 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 691 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:10:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-12-14 13:10:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 481. [2022-12-14 13:10:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 3.24375) internal successors, (1557), 480 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1557 transitions. [2022-12-14 13:10:09,301 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1557 transitions. Word has length 24 [2022-12-14 13:10:09,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:09,302 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 1557 transitions. [2022-12-14 13:10:09,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1557 transitions. [2022-12-14 13:10:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:10:09,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:09,303 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:09,309 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:09,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 13:10:09,505 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:09,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:09,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1240188712, now seen corresponding path program 12 times [2022-12-14 13:10:09,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:09,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238333859] [2022-12-14 13:10:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:09,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:09,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238333859] [2022-12-14 13:10:09,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238333859] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:09,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272502663] [2022-12-14 13:10:09,600 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:10:09,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:09,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:09,600 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:09,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 13:10:09,664 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:10:09,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:09,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:10:09,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:09,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:09,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:09,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:09,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272502663] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:09,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [963914406] [2022-12-14 13:10:09,791 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:09,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:09,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2022-12-14 13:10:09,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731967831] [2022-12-14 13:10:09,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:09,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:10:09,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:09,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:10:09,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:09,793 INFO L87 Difference]: Start difference. First operand 481 states and 1557 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:10,366 INFO L93 Difference]: Finished difference Result 773 states and 2291 transitions. [2022-12-14 13:10:10,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 13:10:10,366 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:10:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:10,370 INFO L225 Difference]: With dead ends: 773 [2022-12-14 13:10:10,370 INFO L226 Difference]: Without dead ends: 767 [2022-12-14 13:10:10,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 13:10:10,371 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 308 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:10,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 57 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:10:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-12-14 13:10:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 481. [2022-12-14 13:10:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 3.160416666666667) internal successors, (1517), 480 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 1517 transitions. [2022-12-14 13:10:10,386 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 1517 transitions. Word has length 24 [2022-12-14 13:10:10,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:10,386 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 1517 transitions. [2022-12-14 13:10:10,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 1517 transitions. [2022-12-14 13:10:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:10:10,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:10,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:10,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:10,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 13:10:10,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:10,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1095480188, now seen corresponding path program 13 times [2022-12-14 13:10:10,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:10,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576844003] [2022-12-14 13:10:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:10,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:10,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576844003] [2022-12-14 13:10:10,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576844003] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:10,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927479326] [2022-12-14 13:10:10,717 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:10:10,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:10,718 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:10,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 13:10:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:10,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 13:10:10,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:10,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:10,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927479326] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:10,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1152224683] [2022-12-14 13:10:10,937 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:10,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:10,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2022-12-14 13:10:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662634959] [2022-12-14 13:10:10,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:10,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-14 13:10:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-14 13:10:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-12-14 13:10:10,938 INFO L87 Difference]: Start difference. First operand 481 states and 1517 transitions. Second operand has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 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-12-14 13:10:11,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:11,206 INFO L93 Difference]: Finished difference Result 555 states and 1637 transitions. [2022-12-14 13:10:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 13:10:11,206 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 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 24 [2022-12-14 13:10:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:11,208 INFO L225 Difference]: With dead ends: 555 [2022-12-14 13:10:11,208 INFO L226 Difference]: Without dead ends: 511 [2022-12-14 13:10:11,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:11,208 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 117 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:11,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 54 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:11,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-12-14 13:10:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 495. [2022-12-14 13:10:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 494 states have (on average 2.983805668016194) internal successors, (1474), 494 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 1474 transitions. [2022-12-14 13:10:11,222 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 1474 transitions. Word has length 24 [2022-12-14 13:10:11,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:11,222 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 1474 transitions. [2022-12-14 13:10:11,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.7333333333333334) internal successors, (56), 14 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-12-14 13:10:11,222 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 1474 transitions. [2022-12-14 13:10:11,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:10:11,223 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:11,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:11,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:11,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 13:10:11,425 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1911451053, now seen corresponding path program 1 times [2022-12-14 13:10:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897580801] [2022-12-14 13:10:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:11,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:11,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:11,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897580801] [2022-12-14 13:10:11,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897580801] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:11,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194011901] [2022-12-14 13:10:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:11,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:11,551 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:11,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 13:10:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:11,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 13:10:11,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:11,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:11,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194011901] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1068486465] [2022-12-14 13:10:11,765 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:11,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2022-12-14 13:10:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331922923] [2022-12-14 13:10:11,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:11,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 13:10:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 13:10:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-12-14 13:10:11,766 INFO L87 Difference]: Start difference. First operand 495 states and 1474 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:12,246 INFO L93 Difference]: Finished difference Result 641 states and 1802 transitions. [2022-12-14 13:10:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-14 13:10:12,246 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:10:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:12,251 INFO L225 Difference]: With dead ends: 641 [2022-12-14 13:10:12,251 INFO L226 Difference]: Without dead ends: 603 [2022-12-14 13:10:12,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-12-14 13:10:12,252 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 155 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:12,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 59 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:10:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-12-14 13:10:12,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 519. [2022-12-14 13:10:12,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 2.9536679536679538) internal successors, (1530), 518 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1530 transitions. [2022-12-14 13:10:12,271 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 1530 transitions. Word has length 24 [2022-12-14 13:10:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:12,271 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 1530 transitions. [2022-12-14 13:10:12,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 17 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:12,271 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 1530 transitions. [2022-12-14 13:10:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 13:10:12,273 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:12,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:12,279 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 13:10:12,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 13:10:12,474 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1960537007, now seen corresponding path program 2 times [2022-12-14 13:10:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:12,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909273535] [2022-12-14 13:10:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:12,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:12,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:12,602 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:12,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909273535] [2022-12-14 13:10:12,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909273535] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:12,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851654417] [2022-12-14 13:10:12,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:12,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:12,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:12,604 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:12,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 13:10:12,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:12,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:12,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 13:10:12,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:12,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:10:12,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 13:10:12,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851654417] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:12,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623586606] [2022-12-14 13:10:12,817 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:12,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:12,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2022-12-14 13:10:12,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496297011] [2022-12-14 13:10:12,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:12,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-14 13:10:12,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:12,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-14 13:10:12,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-12-14 13:10:12,819 INFO L87 Difference]: Start difference. First operand 519 states and 1530 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:13,124 INFO L93 Difference]: Finished difference Result 427 states and 1213 transitions. [2022-12-14 13:10:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 13:10:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 13:10:13,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:13,125 INFO L225 Difference]: With dead ends: 427 [2022-12-14 13:10:13,125 INFO L226 Difference]: Without dead ends: 300 [2022-12-14 13:10:13,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-12-14 13:10:13,126 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 96 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:13,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 52 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-14 13:10:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2022-12-14 13:10:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 3.1471571906354514) internal successors, (941), 299 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 941 transitions. [2022-12-14 13:10:13,130 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 941 transitions. Word has length 24 [2022-12-14 13:10:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:13,131 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 941 transitions. [2022-12-14 13:10:13,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 941 transitions. [2022-12-14 13:10:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:13,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:13,131 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:13,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-14 13:10:13,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:13,333 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:13,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:13,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1025514320, now seen corresponding path program 14 times [2022-12-14 13:10:13,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:13,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284890737] [2022-12-14 13:10:13,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:13,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:13,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284890737] [2022-12-14 13:10:13,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284890737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:13,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437284045] [2022-12-14 13:10:13,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:13,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:13,471 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:13,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 13:10:13,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:13,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:13,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:13,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:13,670 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:13,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:13,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437284045] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:13,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [632965028] [2022-12-14 13:10:13,757 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:13,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:13,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-14 13:10:13,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737122634] [2022-12-14 13:10:13,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:13,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 13:10:13,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:13,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 13:10:13,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-12-14 13:10:13,759 INFO L87 Difference]: Start difference. First operand 300 states and 941 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:14,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:14,099 INFO L93 Difference]: Finished difference Result 514 states and 1592 transitions. [2022-12-14 13:10:14,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 13:10:14,099 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 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 25 [2022-12-14 13:10:14,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:14,100 INFO L225 Difference]: With dead ends: 514 [2022-12-14 13:10:14,101 INFO L226 Difference]: Without dead ends: 514 [2022-12-14 13:10:14,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=524, Unknown=0, NotChecked=0, Total=702 [2022-12-14 13:10:14,101 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 210 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:14,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 36 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2022-12-14 13:10:14,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 332. [2022-12-14 13:10:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.2658610271903323) internal successors, (1081), 331 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1081 transitions. [2022-12-14 13:10:14,107 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 1081 transitions. Word has length 25 [2022-12-14 13:10:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:14,107 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 1081 transitions. [2022-12-14 13:10:14,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:14,108 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 1081 transitions. [2022-12-14 13:10:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:14,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:14,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:14,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-14 13:10:14,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:14,309 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1880820974, now seen corresponding path program 15 times [2022-12-14 13:10:14,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:14,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978357692] [2022-12-14 13:10:14,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:14,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:14,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:14,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978357692] [2022-12-14 13:10:14,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978357692] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:14,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142427008] [2022-12-14 13:10:14,446 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:10:14,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:14,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:14,447 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:14,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 13:10:14,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:10:14,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:14,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:10:14,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:14,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:14,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142427008] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:14,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316770908] [2022-12-14 13:10:14,694 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:14,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:14,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-12-14 13:10:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049368216] [2022-12-14 13:10:14,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:14,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 13:10:14,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:14,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 13:10:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-12-14 13:10:14,696 INFO L87 Difference]: Start difference. First operand 332 states and 1081 transitions. Second operand has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:15,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:15,879 INFO L93 Difference]: Finished difference Result 1072 states and 3257 transitions. [2022-12-14 13:10:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 13:10:15,879 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 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 25 [2022-12-14 13:10:15,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:15,885 INFO L225 Difference]: With dead ends: 1072 [2022-12-14 13:10:15,885 INFO L226 Difference]: Without dead ends: 1072 [2022-12-14 13:10:15,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=691, Invalid=2065, Unknown=0, NotChecked=0, Total=2756 [2022-12-14 13:10:15,886 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 395 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:15,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 64 Invalid, 1132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-14 13:10:15,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2022-12-14 13:10:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 374. [2022-12-14 13:10:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 3.420911528150134) internal successors, (1276), 373 states have internal predecessors, (1276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 1276 transitions. [2022-12-14 13:10:15,895 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 1276 transitions. Word has length 25 [2022-12-14 13:10:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:15,895 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 1276 transitions. [2022-12-14 13:10:15,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 1276 transitions. [2022-12-14 13:10:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:15,896 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:15,896 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:15,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 13:10:16,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:16,097 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:16,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:16,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1444484402, now seen corresponding path program 16 times [2022-12-14 13:10:16,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:16,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906117331] [2022-12-14 13:10:16,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:16,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:16,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:16,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:16,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906117331] [2022-12-14 13:10:16,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906117331] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:16,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225458167] [2022-12-14 13:10:16,229 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:10:16,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:16,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:16,230 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:16,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 13:10:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:16,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:16,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:16,421 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:16,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:16,489 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:16,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225458167] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:16,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457548513] [2022-12-14 13:10:16,490 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:16,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:16,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-14 13:10:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899183056] [2022-12-14 13:10:16,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:16,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:10:16,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:16,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:10:16,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:16,491 INFO L87 Difference]: Start difference. First operand 374 states and 1276 transitions. Second operand has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:16,729 INFO L93 Difference]: Finished difference Result 504 states and 1652 transitions. [2022-12-14 13:10:16,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:10:16,730 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:16,731 INFO L225 Difference]: With dead ends: 504 [2022-12-14 13:10:16,731 INFO L226 Difference]: Without dead ends: 504 [2022-12-14 13:10:16,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2022-12-14 13:10:16,732 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 163 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:16,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 30 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-12-14 13:10:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 364. [2022-12-14 13:10:16,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 3.4159779614325068) internal successors, (1240), 363 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:16,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1240 transitions. [2022-12-14 13:10:16,738 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 1240 transitions. Word has length 25 [2022-12-14 13:10:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:16,739 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 1240 transitions. [2022-12-14 13:10:16,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 18 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 1240 transitions. [2022-12-14 13:10:16,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:16,740 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:16,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:16,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:16,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 13:10:16,941 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1188356672, now seen corresponding path program 17 times [2022-12-14 13:10:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:16,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318468770] [2022-12-14 13:10:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:17,047 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318468770] [2022-12-14 13:10:17,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318468770] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:17,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292709046] [2022-12-14 13:10:17,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:17,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:17,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:17,049 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:17,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-14 13:10:17,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:17,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:17,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:17,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:17,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:17,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:17,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292709046] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:17,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [733958710] [2022-12-14 13:10:17,342 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:17,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:17,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-14 13:10:17,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701700548] [2022-12-14 13:10:17,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:17,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 13:10:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 13:10:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-12-14 13:10:17,347 INFO L87 Difference]: Start difference. First operand 364 states and 1240 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:17,654 INFO L93 Difference]: Finished difference Result 538 states and 1781 transitions. [2022-12-14 13:10:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 13:10:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:17,657 INFO L225 Difference]: With dead ends: 538 [2022-12-14 13:10:17,657 INFO L226 Difference]: Without dead ends: 538 [2022-12-14 13:10:17,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2022-12-14 13:10:17,658 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 203 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:17,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 36 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-12-14 13:10:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 388. [2022-12-14 13:10:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 3.509043927648579) internal successors, (1358), 387 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1358 transitions. [2022-12-14 13:10:17,667 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1358 transitions. Word has length 25 [2022-12-14 13:10:17,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:17,667 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 1358 transitions. [2022-12-14 13:10:17,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:17,667 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1358 transitions. [2022-12-14 13:10:17,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:17,668 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:17,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:17,674 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-14 13:10:17,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 13:10:17,869 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:17,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash -333050018, now seen corresponding path program 18 times [2022-12-14 13:10:17,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:17,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652477569] [2022-12-14 13:10:17,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:17,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:17,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:17,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652477569] [2022-12-14 13:10:17,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652477569] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:17,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10951856] [2022-12-14 13:10:17,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:10:17,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:17,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:17,971 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:17,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-14 13:10:18,044 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:10:18,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:18,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:10:18,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:18,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:18,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:18,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10951856] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:18,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [18616166] [2022-12-14 13:10:18,219 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:18,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:18,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-12-14 13:10:18,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023475738] [2022-12-14 13:10:18,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:18,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 13:10:18,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:18,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 13:10:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-12-14 13:10:18,220 INFO L87 Difference]: Start difference. First operand 388 states and 1358 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:19,160 INFO L93 Difference]: Finished difference Result 552 states and 1814 transitions. [2022-12-14 13:10:19,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 13:10:19,160 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:19,162 INFO L225 Difference]: With dead ends: 552 [2022-12-14 13:10:19,162 INFO L226 Difference]: Without dead ends: 552 [2022-12-14 13:10:19,163 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=562, Invalid=1694, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 13:10:19,163 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 240 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:19,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 69 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 13:10:19,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-12-14 13:10:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 376. [2022-12-14 13:10:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 3.448) internal successors, (1293), 375 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1293 transitions. [2022-12-14 13:10:19,169 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1293 transitions. Word has length 25 [2022-12-14 13:10:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:19,170 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 1293 transitions. [2022-12-14 13:10:19,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1293 transitions. [2022-12-14 13:10:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:19,170 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:19,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:19,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-14 13:10:19,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 13:10:19,372 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:19,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:19,373 INFO L85 PathProgramCache]: Analyzing trace with hash 636611902, now seen corresponding path program 19 times [2022-12-14 13:10:19,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:19,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598109932] [2022-12-14 13:10:19,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:19,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:19,472 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598109932] [2022-12-14 13:10:19,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598109932] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:19,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538871743] [2022-12-14 13:10:19,472 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:10:19,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:19,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:19,473 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:19,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-14 13:10:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:19,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:19,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:19,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:19,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538871743] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:19,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [991774933] [2022-12-14 13:10:19,727 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:19,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:19,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-14 13:10:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233054614] [2022-12-14 13:10:19,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:19,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:10:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:10:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:19,728 INFO L87 Difference]: Start difference. First operand 376 states and 1293 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:20,013 INFO L93 Difference]: Finished difference Result 418 states and 1392 transitions. [2022-12-14 13:10:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:10:20,014 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:20,015 INFO L225 Difference]: With dead ends: 418 [2022-12-14 13:10:20,015 INFO L226 Difference]: Without dead ends: 418 [2022-12-14 13:10:20,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-12-14 13:10:20,016 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 146 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:20,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 38 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-12-14 13:10:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 364. [2022-12-14 13:10:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 3.4159779614325068) internal successors, (1240), 363 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:20,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1240 transitions. [2022-12-14 13:10:20,021 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 1240 transitions. Word has length 25 [2022-12-14 13:10:20,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:20,021 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 1240 transitions. [2022-12-14 13:10:20,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:20,021 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 1240 transitions. [2022-12-14 13:10:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:20,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:20,022 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:20,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-14 13:10:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-14 13:10:20,223 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:20,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash -603237126, now seen corresponding path program 20 times [2022-12-14 13:10:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:20,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203708804] [2022-12-14 13:10:20,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:20,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:20,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203708804] [2022-12-14 13:10:20,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203708804] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:20,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529090455] [2022-12-14 13:10:20,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:20,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:20,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:20,344 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:20,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-14 13:10:20,450 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:20,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:20,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:20,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:20,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:20,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529090455] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:20,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [834101225] [2022-12-14 13:10:20,612 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:20,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:20,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-12-14 13:10:20,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277531170] [2022-12-14 13:10:20,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:20,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-14 13:10:20,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:20,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-14 13:10:20,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-12-14 13:10:20,614 INFO L87 Difference]: Start difference. First operand 364 states and 1240 transitions. Second operand has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:21,046 INFO L93 Difference]: Finished difference Result 714 states and 2349 transitions. [2022-12-14 13:10:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-14 13:10:21,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:21,052 INFO L225 Difference]: With dead ends: 714 [2022-12-14 13:10:21,052 INFO L226 Difference]: Without dead ends: 714 [2022-12-14 13:10:21,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=277, Invalid=715, Unknown=0, NotChecked=0, Total=992 [2022-12-14 13:10:21,053 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 215 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:21,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 56 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 13:10:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-12-14 13:10:21,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 388. [2022-12-14 13:10:21,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 3.509043927648579) internal successors, (1358), 387 states have internal predecessors, (1358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1358 transitions. [2022-12-14 13:10:21,063 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1358 transitions. Word has length 25 [2022-12-14 13:10:21,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:21,063 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 1358 transitions. [2022-12-14 13:10:21,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 20 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1358 transitions. [2022-12-14 13:10:21,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:21,065 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:21,065 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:21,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:21,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-14 13:10:21,266 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:21,268 INFO L85 PathProgramCache]: Analyzing trace with hash 252069528, now seen corresponding path program 21 times [2022-12-14 13:10:21,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:21,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688864590] [2022-12-14 13:10:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:21,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:21,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688864590] [2022-12-14 13:10:21,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688864590] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:21,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813809281] [2022-12-14 13:10:21,397 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:10:21,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:21,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:21,398 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:21,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-14 13:10:21,475 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:10:21,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:21,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 13:10:21,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:21,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:21,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813809281] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:21,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [296905902] [2022-12-14 13:10:21,604 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:21,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:21,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-12-14 13:10:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73216920] [2022-12-14 13:10:21,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:21,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 13:10:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 13:10:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-12-14 13:10:21,605 INFO L87 Difference]: Start difference. First operand 388 states and 1358 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:22,994 INFO L93 Difference]: Finished difference Result 700 states and 2318 transitions. [2022-12-14 13:10:22,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-12-14 13:10:22,995 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:22,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:23,000 INFO L225 Difference]: With dead ends: 700 [2022-12-14 13:10:23,000 INFO L226 Difference]: Without dead ends: 700 [2022-12-14 13:10:23,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=977, Invalid=2563, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 13:10:23,001 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 234 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:23,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 113 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-14 13:10:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-12-14 13:10:23,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 376. [2022-12-14 13:10:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 375 states have (on average 3.448) internal successors, (1293), 375 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 1293 transitions. [2022-12-14 13:10:23,013 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 1293 transitions. Word has length 25 [2022-12-14 13:10:23,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:23,013 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 1293 transitions. [2022-12-14 13:10:23,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 1293 transitions. [2022-12-14 13:10:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 13:10:23,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:23,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:23,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-14 13:10:23,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-14 13:10:23,216 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:23,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1718807102, now seen corresponding path program 22 times [2022-12-14 13:10:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:23,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711916185] [2022-12-14 13:10:23,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:23,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:23,320 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711916185] [2022-12-14 13:10:23,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711916185] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:23,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263643715] [2022-12-14 13:10:23,320 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:10:23,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:23,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:23,321 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:23,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-14 13:10:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:23,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 13:10:23,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:23,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:23,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:10:23,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263643715] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:23,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [38203814] [2022-12-14 13:10:23,536 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:23,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:23,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-12-14 13:10:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500827079] [2022-12-14 13:10:23,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:23,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-14 13:10:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:23,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-14 13:10:23,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-14 13:10:23,538 INFO L87 Difference]: Start difference. First operand 376 states and 1293 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:23,761 INFO L93 Difference]: Finished difference Result 474 states and 1569 transitions. [2022-12-14 13:10:23,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 13:10:23,762 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 13:10:23,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:23,766 INFO L225 Difference]: With dead ends: 474 [2022-12-14 13:10:23,766 INFO L226 Difference]: Without dead ends: 474 [2022-12-14 13:10:23,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2022-12-14 13:10:23,767 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 172 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 37 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 13:10:23,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-12-14 13:10:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 388. [2022-12-14 13:10:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 387 states have (on average 3.4160206718346253) internal successors, (1322), 387 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1322 transitions. [2022-12-14 13:10:23,777 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1322 transitions. Word has length 25 [2022-12-14 13:10:23,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:23,777 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 1322 transitions. [2022-12-14 13:10:23,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1322 transitions. [2022-12-14 13:10:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:10:23,778 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:23,779 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:23,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-12-14 13:10:23,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-14 13:10:23,980 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1237799096, now seen corresponding path program 23 times [2022-12-14 13:10:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:23,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814393784] [2022-12-14 13:10:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:23,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:10:25,389 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:25,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814393784] [2022-12-14 13:10:25,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814393784] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:25,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012096530] [2022-12-14 13:10:25,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:10:25,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:25,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:25,391 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:25,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-14 13:10:25,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-14 13:10:25,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:25,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 13:10:25,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:10:26,013 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 97 treesize of output 81 [2022-12-14 13:10:26,492 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:10:26,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:10:26,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:10:26,498 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:26,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 84 [2022-12-14 13:10:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:26,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:27,400 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse18 (* 4 c_~M~0))) (let ((.cse4 (= c_~max1~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset .cse18 4)) (.cse2 (+ c_~A~0.offset .cse18))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0) (not (< c_~max3~0 .cse0)) (< c_~max3~0 (select .cse1 .cse2)))))) (or .cse4 (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse5 (select .cse6 .cse3))) (or (not (< c_~max3~0 .cse5)) (< c_~max2~0 .cse5) (< c_~max3~0 (select .cse6 .cse2))))))) (or .cse4 (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse7 (select .cse9 .cse2)) (.cse8 (select .cse9 .cse3))) (or (not (< c_~max3~0 .cse7)) (not (< .cse7 .cse8)) (< c_~max2~0 .cse8)))))) (or (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (or (< c_~max3~0 (select .cse10 .cse3)) (< c_~max3~0 (select .cse10 .cse2))))) (and (or .cse4 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))) (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse12 (select .cse13 .cse2)) (.cse11 (select .cse13 .cse3))) (or (= c_~max1~0 .cse11) (not (< c_~max3~0 .cse12)) (not (< .cse12 .cse11)) (<= .cse11 c_~max2~0))))) (or (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse14 (select .cse15 .cse2))) (or (not (< c_~max3~0 .cse14)) (< .cse14 (select .cse15 .cse3)) (< c_~max2~0 .cse14))))) .cse4) (forall ((v_ArrVal_1278 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1278) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse2))) (or (not (< c_~max3~0 .cse16)) (= c_~max1~0 .cse16) (< .cse16 (select .cse17 .cse3)) (<= .cse16 c_~max2~0)))))))) is different from false [2022-12-14 13:10:28,229 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1784 treesize of output 1237 [2022-12-14 13:10:28,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,255 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 1162 treesize of output 1142 [2022-12-14 13:10:28,279 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,280 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 1142 treesize of output 1111 [2022-12-14 13:10:28,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,303 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 1111 treesize of output 1086 [2022-12-14 13:10:28,326 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,327 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 1086 treesize of output 1059 [2022-12-14 13:10:28,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,356 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 1059 treesize of output 1026 [2022-12-14 13:10:28,380 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,381 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 1026 treesize of output 1013 [2022-12-14 13:10:28,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,406 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 1013 treesize of output 987 [2022-12-14 13:10:28,430 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,430 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 987 treesize of output 956 [2022-12-14 13:10:28,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,455 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 956 treesize of output 929 [2022-12-14 13:10:28,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,479 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 929 treesize of output 896 [2022-12-14 13:10:28,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,503 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 896 treesize of output 876 [2022-12-14 13:10:28,532 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,533 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 876 treesize of output 850 [2022-12-14 13:10:28,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,558 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 850 treesize of output 837 [2022-12-14 13:10:28,581 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:28,582 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 837 treesize of output 812 [2022-12-14 13:10:32,569 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 2 not checked. [2022-12-14 13:10:32,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012096530] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:10:32,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233998025] [2022-12-14 13:10:32,569 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:10:32,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:10:32,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 37 [2022-12-14 13:10:32,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743826782] [2022-12-14 13:10:32,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:10:32,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-14 13:10:32,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:10:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-14 13:10:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1266, Unknown=1, NotChecked=72, Total=1482 [2022-12-14 13:10:32,572 INFO L87 Difference]: Start difference. First operand 388 states and 1322 transitions. Second operand has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 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-12-14 13:10:40,660 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 94 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:10:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:10:42,305 INFO L93 Difference]: Finished difference Result 541 states and 1738 transitions. [2022-12-14 13:10:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-14 13:10:42,305 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 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 26 [2022-12-14 13:10:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:10:42,307 INFO L225 Difference]: With dead ends: 541 [2022-12-14 13:10:42,307 INFO L226 Difference]: Without dead ends: 534 [2022-12-14 13:10:42,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=359, Invalid=2613, Unknown=2, NotChecked=106, Total=3080 [2022-12-14 13:10:42,308 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 210 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 13:10:42,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 80 Invalid, 2106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1983 Invalid, 0 Unknown, 111 Unchecked, 1.9s Time] [2022-12-14 13:10:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2022-12-14 13:10:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 414. [2022-12-14 13:10:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 3.3462469733656173) internal successors, (1382), 413 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:10:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1382 transitions. [2022-12-14 13:10:42,317 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 1382 transitions. Word has length 26 [2022-12-14 13:10:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:10:42,317 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 1382 transitions. [2022-12-14 13:10:42,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 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-12-14 13:10:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 1382 transitions. [2022-12-14 13:10:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:10:42,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:10:42,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:10:42,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-14 13:10:42,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-14 13:10:42,519 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:10:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:10:42,520 INFO L85 PathProgramCache]: Analyzing trace with hash 360983688, now seen corresponding path program 24 times [2022-12-14 13:10:42,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:10:42,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731118915] [2022-12-14 13:10:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:10:42,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:10:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:10:43,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:10:43,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:10:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731118915] [2022-12-14 13:10:43,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731118915] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:10:43,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128048409] [2022-12-14 13:10:43,854 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 13:10:43,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:10:43,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:10:43,855 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:10:43,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-14 13:10:43,951 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 13:10:43,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:10:43,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-14 13:10:43,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:10:44,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:10:44,310 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 50 treesize of output 48 [2022-12-14 13:10:44,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:10:44,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:44,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 160 treesize of output 108 [2022-12-14 13:10:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:10:45,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:10:48,484 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 13:10:48,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2391 treesize of output 1723 [2022-12-14 13:10:48,536 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1662 treesize of output 1648 [2022-12-14 13:10:48,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1621 treesize of output 1609 [2022-12-14 13:10:48,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1582 treesize of output 1562 [2022-12-14 13:10:48,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1535 treesize of output 1522 [2022-12-14 13:10:48,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1495 treesize of output 1495 [2022-12-14 13:10:48,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1468 treesize of output 1457 [2022-12-14 13:10:48,840 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1430 treesize of output 1430 [2022-12-14 13:10:48,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1403 treesize of output 1403 [2022-12-14 13:10:48,953 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:48,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1376 treesize of output 1369 [2022-12-14 13:10:49,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1342 treesize of output 1349 [2022-12-14 13:10:49,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1322 treesize of output 1304 [2022-12-14 13:10:49,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1277 treesize of output 1270 [2022-12-14 13:10:49,197 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1243 treesize of output 1238 [2022-12-14 13:10:49,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1211 treesize of output 1198 [2022-12-14 13:10:49,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:10:49,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1171 treesize of output 1165 [2022-12-14 13:13:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:13:09,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128048409] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:13:09,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [360895785] [2022-12-14 13:13:09,543 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:13:09,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:13:09,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 38 [2022-12-14 13:13:09,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961196597] [2022-12-14 13:13:09,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:13:09,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 13:13:09,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:13:09,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 13:13:09,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1400, Unknown=1, NotChecked=0, Total=1560 [2022-12-14 13:13:09,545 INFO L87 Difference]: Start difference. First operand 414 states and 1382 transitions. Second operand has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:33,462 WARN L233 SmtUtils]: Spent 15.05s on a formula simplification. DAG size of input: 153 DAG size of output: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 13:13:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:13:41,238 INFO L93 Difference]: Finished difference Result 580 states and 1752 transitions. [2022-12-14 13:13:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 13:13:41,239 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 13:13:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:13:41,241 INFO L225 Difference]: With dead ends: 580 [2022-12-14 13:13:41,241 INFO L226 Difference]: Without dead ends: 566 [2022-12-14 13:13:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=545, Invalid=3360, Unknown=1, NotChecked=0, Total=3906 [2022-12-14 13:13:41,242 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 253 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-12-14 13:13:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 86 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-12-14 13:13:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-12-14 13:13:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 422. [2022-12-14 13:13:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 3.342042755344418) internal successors, (1407), 421 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1407 transitions. [2022-12-14 13:13:41,248 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1407 transitions. Word has length 26 [2022-12-14 13:13:41,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:13:41,248 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 1407 transitions. [2022-12-14 13:13:41,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:13:41,248 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1407 transitions. [2022-12-14 13:13:41,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:13:41,249 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:13:41,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:13:41,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-14 13:13:41,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:13:41,450 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:13:41,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:13:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1719542672, now seen corresponding path program 25 times [2022-12-14 13:13:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:13:41,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007148837] [2022-12-14 13:13:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:13:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:13:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:13:43,546 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:13:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007148837] [2022-12-14 13:13:43,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007148837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:13:43,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665383292] [2022-12-14 13:13:43,547 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 13:13:43,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:13:43,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:13:43,548 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:13:43,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-14 13:13:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:13:43,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-14 13:13:43,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:13:44,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:13:44,038 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 35 treesize of output 33 [2022-12-14 13:13:44,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:13:44,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:13:44,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:13:44,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 13:13:44,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:44,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 84 [2022-12-14 13:13:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 13:13:44,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 13:13:46,696 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse45 (* 4 c_~M~0))) (let ((.cse9 (< c_~max2~0 c_~max3~0)) (.cse28 (<= c_~max3~0 c_~max2~0)) (.cse22 (= c_~max1~0 c_~max2~0)) (.cse4 (+ c_~A~0.offset .cse45 4)) (.cse5 (+ c_~A~0.offset .cse45)) (.cse6 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (not (< c_~max1~0 .cse0)) (= .cse0 c_~max2~0) (not (< .cse1 .cse2)) (not (< c_~max3~0 .cse1)) (< c_~max2~0 .cse2))))) (or (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse6))) (or (not (< c_~max1~0 .cse7)) (< c_~max3~0 (select .cse8 .cse5)) (< c_~max3~0 (select .cse8 .cse4)) (= .cse7 c_~max2~0))))) .cse9) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse4)) (.cse12 (select .cse11 .cse5))) (or (= c_~max1~0 .cse10) (<= .cse10 c_~max2~0) (< c_~max1~0 (select .cse11 .cse6)) (not (< .cse12 .cse10)) (not (< c_~max3~0 .cse12)))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse4))) (or (not (< c_~max3~0 .cse13)) (= c_~max1~0 .cse13) (< c_~max3~0 (select .cse14 .cse5)) (<= .cse13 c_~max2~0) (< c_~max1~0 (select .cse14 .cse6)))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse15 (select .cse18 .cse6)) (.cse16 (select .cse18 .cse4)) (.cse17 (select .cse18 .cse5))) (or (not (< c_~max1~0 .cse15)) (<= .cse16 c_~max2~0) (= .cse15 .cse16) (not (< .cse17 .cse16)) (not (< c_~max3~0 .cse17)))))) (or (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse20 (select .cse19 .cse5)) (.cse21 (select .cse19 .cse4))) (or (< c_~max1~0 (select .cse19 .cse6)) (not (< .cse20 .cse21)) (not (< c_~max3~0 .cse20)) (< c_~max2~0 .cse21))))) .cse22) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse23 (select .cse25 .cse6)) (.cse24 (select .cse25 .cse4))) (or (not (< c_~max1~0 .cse23)) (not (< c_~max3~0 .cse24)) (< c_~max3~0 (select .cse25 .cse5)) (<= .cse24 c_~max2~0) (= .cse23 .cse24))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse26 (select .cse27 .cse5))) (or (= c_~max1~0 .cse26) (<= .cse26 c_~max2~0) (< .cse26 (select .cse27 .cse4)) (< c_~max1~0 (select .cse27 .cse6)) (not (< c_~max3~0 .cse26)))))) (or (and (or .cse22 .cse9) (or (= c_~max1~0 c_~max3~0) .cse28)) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (or (< c_~max3~0 (select .cse29 .cse5)) (< c_~max3~0 (select .cse29 .cse4)) (< c_~max1~0 (select .cse29 .cse6)))))) (or (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse4))) (or (not (< c_~max3~0 .cse30)) (< c_~max3~0 (select .cse31 .cse5)) (< c_~max1~0 (select .cse31 .cse6)) (< c_~max2~0 .cse30))))) .cse22) (or .cse28 (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse32 (select .cse33 .cse6))) (or (not (< c_~max1~0 .cse32)) (< c_~max3~0 (select .cse33 .cse5)) (< c_~max3~0 (select .cse33 .cse4)) (= .cse32 c_~max3~0)))))) (or .cse22 (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse34 (select .cse35 .cse5))) (or (< c_~max2~0 .cse34) (< .cse34 (select .cse35 .cse4)) (< c_~max1~0 (select .cse35 .cse6)) (not (< c_~max3~0 .cse34))))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse6)) (.cse37 (select .cse38 .cse4))) (or (not (< c_~max1~0 .cse36)) (not (< c_~max3~0 .cse37)) (< c_~max3~0 (select .cse38 .cse5)) (= .cse36 c_~max2~0) (< c_~max2~0 .cse37))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse41 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse39 (select .cse41 .cse6)) (.cse40 (select .cse41 .cse5))) (or (not (< c_~max1~0 .cse39)) (<= .cse40 c_~max2~0) (= .cse39 .cse40) (< .cse40 (select .cse41 .cse4)) (not (< c_~max3~0 .cse40)))))) (forall ((v_ArrVal_1376 (Array Int Int))) (let ((.cse44 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1376) c_~A~0.base))) (let ((.cse42 (select .cse44 .cse6)) (.cse43 (select .cse44 .cse5))) (or (not (< c_~max1~0 .cse42)) (< c_~max2~0 .cse43) (= .cse42 c_~max2~0) (< .cse43 (select .cse44 .cse4)) (not (< c_~max3~0 .cse43))))))))) is different from false [2022-12-14 13:13:46,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:46,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2391 treesize of output 1737 [2022-12-14 13:13:46,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:46,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1662 treesize of output 1651 [2022-12-14 13:13:46,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:46,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1624 treesize of output 1617 [2022-12-14 13:13:46,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:46,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1590 treesize of output 1585 [2022-12-14 13:13:47,030 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1558 treesize of output 1558 [2022-12-14 13:13:47,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1531 treesize of output 1517 [2022-12-14 13:13:47,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1490 treesize of output 1470 [2022-12-14 13:13:47,196 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1443 treesize of output 1430 [2022-12-14 13:13:47,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1403 treesize of output 1391 [2022-12-14 13:13:47,316 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1364 treesize of output 1371 [2022-12-14 13:13:47,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1344 treesize of output 1326 [2022-12-14 13:13:47,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1299 treesize of output 1293 [2022-12-14 13:13:47,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1266 treesize of output 1266 [2022-12-14 13:13:47,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1239 treesize of output 1239 [2022-12-14 13:13:47,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1212 treesize of output 1199 [2022-12-14 13:13:47,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 13:13:47,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1172 treesize of output 1165 [2022-12-14 13:17:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 13:17:31,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665383292] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 13:17:31,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729818469] [2022-12-14 13:17:31,823 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 13:17:31,823 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 13:17:31,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 11] total 38 [2022-12-14 13:17:31,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795967921] [2022-12-14 13:17:31,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 13:17:31,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 13:17:31,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 13:17:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 13:17:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1335, Unknown=1, NotChecked=74, Total=1560 [2022-12-14 13:17:31,824 INFO L87 Difference]: Start difference. First operand 422 states and 1407 transitions. Second operand has 40 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 39 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-12-14 13:17:37,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 13:17:37,623 INFO L93 Difference]: Finished difference Result 631 states and 1889 transitions. [2022-12-14 13:17:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-14 13:17:37,624 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 39 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 26 [2022-12-14 13:17:37,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 13:17:37,625 INFO L225 Difference]: With dead ends: 631 [2022-12-14 13:17:37,625 INFO L226 Difference]: Without dead ends: 610 [2022-12-14 13:17:37,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=492, Invalid=3171, Unknown=1, NotChecked=118, Total=3782 [2022-12-14 13:17:37,626 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 246 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1850 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 13:17:37,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 63 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1850 Invalid, 0 Unknown, 140 Unchecked, 1.9s Time] [2022-12-14 13:17:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-12-14 13:17:37,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 438. [2022-12-14 13:17:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 437 states have (on average 3.34324942791762) internal successors, (1461), 437 states have internal predecessors, (1461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 13:17:37,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1461 transitions. [2022-12-14 13:17:37,632 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1461 transitions. Word has length 26 [2022-12-14 13:17:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 13:17:37,633 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 1461 transitions. [2022-12-14 13:17:37,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9743589743589745) internal successors, (77), 39 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-12-14 13:17:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1461 transitions. [2022-12-14 13:17:37,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 13:17:37,633 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 13:17:37,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 13:17:37,638 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-14 13:17:37,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-12-14 13:17:37,835 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 13:17:37,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 13:17:37,836 INFO L85 PathProgramCache]: Analyzing trace with hash -124088440, now seen corresponding path program 26 times [2022-12-14 13:17:37,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 13:17:37,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670164647] [2022-12-14 13:17:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 13:17:37,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 13:17:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 13:17:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 13:17:39,568 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 13:17:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670164647] [2022-12-14 13:17:39,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670164647] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 13:17:39,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717345326] [2022-12-14 13:17:39,568 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 13:17:39,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 13:17:39,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 13:17:39,569 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 13:17:39,570 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7017e538-a9b5-426c-9cc9-0bc5b8d3e87d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-14 13:17:39,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 13:17:39,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 13:17:39,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-14 13:17:39,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 13:17:39,786 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 15 treesize of output 11 [2022-12-14 13:17:39,861 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-12-14 13:17:39,937 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-12-14 13:17:40,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 13:17:40,269 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 35 treesize of output 33 [2022-12-14 13:17:41,725 INFO L321 Elim1Store]: treesize reduction 40, result has 90.4 percent of original size [2022-12-14 13:17:41,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 235 treesize of output 515 [2022-12-14 13:17:54,938 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 13:18:39,662 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 13:19:54,992 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 13:20:28,418 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 13:21:32,534 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts.