./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 20:21:39,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 20:21:39,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 20:21:39,914 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 20:21:39,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 20:21:39,918 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 20:21:39,921 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 20:21:39,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 20:21:39,926 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 20:21:39,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 20:21:39,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 20:21:39,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 20:21:39,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 20:21:39,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 20:21:39,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 20:21:39,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 20:21:39,947 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 20:21:39,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 20:21:39,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 20:21:39,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 20:21:39,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 20:21:39,960 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 20:21:39,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 20:21:39,962 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 20:21:39,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 20:21:39,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 20:21:39,973 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 20:21:39,975 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 20:21:39,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 20:21:39,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 20:21:39,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 20:21:39,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 20:21:39,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 20:21:39,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 20:21:39,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 20:21:39,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 20:21:39,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 20:21:39,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 20:21:39,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 20:21:39,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 20:21:40,010 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 20:21:40,011 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-20 20:21:40,046 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 20:21:40,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 20:21:40,047 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 20:21:40,047 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 20:21:40,048 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 20:21:40,048 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 20:21:40,048 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-20 20:21:40,049 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-20 20:21:40,049 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-20 20:21:40,049 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-20 20:21:40,049 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-20 20:21:40,049 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-20 20:21:40,050 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-20 20:21:40,050 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-20 20:21:40,050 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-20 20:21:40,050 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-20 20:21:40,050 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-20 20:21:40,051 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-20 20:21:40,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 20:21:40,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 20:21:40,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 20:21:40,053 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 20:21:40,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 20:21:40,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 20:21:40,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 20:21:40,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 20:21:40,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 20:21:40,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:21:40,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 20:21:40,054 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-20 20:21:40,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 20:21:40,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 20:21:40,063 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-20 20:21:40,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 20:21:40,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 20:21:40,064 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-20 20:21:40,064 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_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/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_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b8fef41c3119c5f4fc9586ebd31a4ff7152be41d9f2f8da139e8cd34cf0da86 [2022-11-20 20:21:40,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 20:21:40,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 20:21:40,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 20:21:40,394 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 20:21:40,395 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 20:21:40,396 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/../../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-20 20:21:43,428 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 20:21:43,675 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 20:21:43,676 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2022-11-20 20:21:43,689 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/data/df2c275c0/38d7cc87ed3145edaa7782bad136f70e/FLAG9a1ed20a4 [2022-11-20 20:21:43,705 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/data/df2c275c0/38d7cc87ed3145edaa7782bad136f70e [2022-11-20 20:21:43,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 20:21:43,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 20:21:43,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 20:21:43,717 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 20:21:43,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 20:21:43,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:43" (1/1) ... [2022-11-20 20:21:43,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cb0a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:43, skipping insertion in model container [2022-11-20 20:21:43,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:21:43" (1/1) ... [2022-11-20 20:21:43,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 20:21:43,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 20:21:44,014 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_90bf2826-af28-4358-8bd1-8117127b2353/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-20 20:21:44,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:21:44,034 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 20:21:44,066 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_90bf2826-af28-4358-8bd1-8117127b2353/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2022-11-20 20:21:44,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 20:21:44,086 INFO L208 MainTranslator]: Completed translation [2022-11-20 20:21:44,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44 WrapperNode [2022-11-20 20:21:44,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 20:21:44,088 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 20:21:44,088 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 20:21:44,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 20:21:44,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,155 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 289 [2022-11-20 20:21:44,163 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 20:21:44,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 20:21:44,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 20:21:44,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 20:21:44,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 20:21:44,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 20:21:44,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 20:21:44,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 20:21:44,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (1/1) ... [2022-11-20 20:21:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 20:21:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:21:44,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 20:21:44,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 20:21:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 20:21:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 20:21:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 20:21:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 20:21:44,336 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 20:21:44,336 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 20:21:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 20:21:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 20:21:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 20:21:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 20:21:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-11-20 20:21:44,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-11-20 20:21:44,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 20:21:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-11-20 20:21:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-11-20 20:21:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-11-20 20:21:44,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-11-20 20:21:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 20:21:44,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 20:21:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 20:21:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 20:21:44,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 20:21:44,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 20:21:44,341 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 20:21:44,477 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 20:21:44,479 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 20:21:45,148 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 20:21:45,393 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 20:21:45,393 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-20 20:21:45,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:45 BoogieIcfgContainer [2022-11-20 20:21:45,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 20:21:45,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 20:21:45,399 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 20:21:45,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 20:21:45,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:21:43" (1/3) ... [2022-11-20 20:21:45,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53189133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:45, skipping insertion in model container [2022-11-20 20:21:45,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:21:44" (2/3) ... [2022-11-20 20:21:45,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53189133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:21:45, skipping insertion in model container [2022-11-20 20:21:45,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:21:45" (3/3) ... [2022-11-20 20:21:45,405 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2022-11-20 20:21:45,414 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 20:21:45,424 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 20:21:45,425 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 20:21:45,425 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 20:21:45,600 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-11-20 20:21:45,663 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-20 20:21:45,682 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-20 20:21:45,685 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 261 places, 260 transitions, 592 flow [2022-11-20 20:21:45,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 260 transitions, 592 flow [2022-11-20 20:21:45,882 INFO L130 PetriNetUnfolder]: 18/232 cut-off events. [2022-11-20 20:21:45,882 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 20:21:45,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 232 events. 18/232 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 285 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 200. Up to 3 conditions per place. [2022-11-20 20:21:45,926 INFO L119 LiptonReduction]: Number of co-enabled transitions 7312 [2022-11-20 20:21:54,927 INFO L134 LiptonReduction]: Checked pairs total: 36353 [2022-11-20 20:21:54,927 INFO L136 LiptonReduction]: Total number of compositions: 204 [2022-11-20 20:21:54,940 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 82 transitions, 236 flow [2022-11-20 20:21:55,344 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:55,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 20:21:55,370 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;@53c2c334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 20:21:55,370 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-11-20 20:21:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 20:21:55,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:55,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:55,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:21:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:55,433 INFO L85 PathProgramCache]: Analyzing trace with hash 325335062, now seen corresponding path program 1 times [2022-11-20 20:21:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:55,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122416397] [2022-11-20 20:21:55,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:56,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:56,193 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:56,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122416397] [2022-11-20 20:21:56,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122416397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:56,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:56,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:21:56,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254446577] [2022-11-20 20:21:56,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:56,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:21:56,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:21:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:21:56,238 INFO L87 Difference]: Start difference. First operand has 5101 states, 5100 states have (on average 4.53) internal successors, (23103), 5100 states have internal predecessors, (23103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:56,775 INFO L93 Difference]: Finished difference Result 14006 states and 64835 transitions. [2022-11-20 20:21:56,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:21:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-20 20:21:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:56,939 INFO L225 Difference]: With dead ends: 14006 [2022-11-20 20:21:56,940 INFO L226 Difference]: Without dead ends: 13825 [2022-11-20 20:21:56,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:21:56,945 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 85 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:56,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 87 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:21:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13825 states. [2022-11-20 20:21:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13825 to 6933. [2022-11-20 20:21:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6933 states, 6932 states have (on average 4.474321984997115) internal successors, (31016), 6932 states have internal predecessors, (31016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6933 states to 6933 states and 31016 transitions. [2022-11-20 20:21:57,615 INFO L78 Accepts]: Start accepts. Automaton has 6933 states and 31016 transitions. Word has length 52 [2022-11-20 20:21:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:57,616 INFO L495 AbstractCegarLoop]: Abstraction has 6933 states and 31016 transitions. [2022-11-20 20:21:57,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6933 states and 31016 transitions. [2022-11-20 20:21:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-20 20:21:57,645 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:57,645 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:57,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 20:21:57,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:21:57,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash 432429094, now seen corresponding path program 2 times [2022-11-20 20:21:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:57,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654969113] [2022-11-20 20:21:57,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:21:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:21:57,974 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:21:57,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654969113] [2022-11-20 20:21:57,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654969113] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:21:57,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:21:57,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 20:21:57,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012016745] [2022-11-20 20:21:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:21:57,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-20 20:21:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:21:57,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 20:21:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-20 20:21:57,978 INFO L87 Difference]: Start difference. First operand 6933 states and 31016 transitions. Second operand has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:21:58,531 INFO L93 Difference]: Finished difference Result 15474 states and 71548 transitions. [2022-11-20 20:21:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 20:21:58,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-20 20:21:58,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:21:58,635 INFO L225 Difference]: With dead ends: 15474 [2022-11-20 20:21:58,636 INFO L226 Difference]: Without dead ends: 15293 [2022-11-20 20:21:58,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:21:58,638 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:21:58,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 90 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:21:58,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15293 states. [2022-11-20 20:21:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15293 to 7065. [2022-11-20 20:21:59,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7065 states, 7064 states have (on average 4.462061155152888) internal successors, (31520), 7064 states have internal predecessors, (31520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7065 states to 7065 states and 31520 transitions. [2022-11-20 20:21:59,332 INFO L78 Accepts]: Start accepts. Automaton has 7065 states and 31520 transitions. Word has length 52 [2022-11-20 20:21:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:21:59,351 INFO L495 AbstractCegarLoop]: Abstraction has 7065 states and 31520 transitions. [2022-11-20 20:21:59,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.333333333333332) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:21:59,353 INFO L276 IsEmpty]: Start isEmpty. Operand 7065 states and 31520 transitions. [2022-11-20 20:21:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 20:21:59,425 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:21:59,425 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:21:59,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 20:21:59,427 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:21:59,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:21:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582988, now seen corresponding path program 1 times [2022-11-20 20:21:59,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:21:59,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213740322] [2022-11-20 20:21:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:21:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:21:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:00,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:00,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:00,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213740322] [2022-11-20 20:22:00,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213740322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:22:00,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:22:00,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:22:00,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321578391] [2022-11-20 20:22:00,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:00,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:22:00,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:22:00,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:22:00,176 INFO L87 Difference]: Start difference. First operand 7065 states and 31520 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:00,641 INFO L93 Difference]: Finished difference Result 11967 states and 49648 transitions. [2022-11-20 20:22:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:22:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-20 20:22:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:00,783 INFO L225 Difference]: With dead ends: 11967 [2022-11-20 20:22:00,784 INFO L226 Difference]: Without dead ends: 11355 [2022-11-20 20:22:00,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:22:00,785 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:00,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 114 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:22:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11355 states. [2022-11-20 20:22:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11355 to 8501. [2022-11-20 20:22:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8501 states, 8500 states have (on average 4.270117647058823) internal successors, (36296), 8500 states have internal predecessors, (36296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8501 states to 8501 states and 36296 transitions. [2022-11-20 20:22:01,208 INFO L78 Accepts]: Start accepts. Automaton has 8501 states and 36296 transitions. Word has length 54 [2022-11-20 20:22:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:01,208 INFO L495 AbstractCegarLoop]: Abstraction has 8501 states and 36296 transitions. [2022-11-20 20:22:01,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 8501 states and 36296 transitions. [2022-11-20 20:22:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-20 20:22:01,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:01,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 20:22:01,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:01,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1721045454, now seen corresponding path program 1 times [2022-11-20 20:22:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:01,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668890327] [2022-11-20 20:22:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:01,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:01,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:01,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668890327] [2022-11-20 20:22:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668890327] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 20:22:01,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 20:22:01,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-20 20:22:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347955015] [2022-11-20 20:22:01,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-20 20:22:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-20 20:22:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-20 20:22:01,616 INFO L87 Difference]: Start difference. First operand 8501 states and 36296 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:01,893 INFO L93 Difference]: Finished difference Result 8515 states and 34660 transitions. [2022-11-20 20:22:01,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-20 20:22:01,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-11-20 20:22:01,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:01,931 INFO L225 Difference]: With dead ends: 8515 [2022-11-20 20:22:01,931 INFO L226 Difference]: Without dead ends: 6868 [2022-11-20 20:22:01,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-20 20:22:01,932 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:01,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 89 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:22:01,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2022-11-20 20:22:02,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6868. [2022-11-20 20:22:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6868 states, 6867 states have (on average 4.300859181593126) internal successors, (29534), 6867 states have internal predecessors, (29534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:02,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6868 states to 6868 states and 29534 transitions. [2022-11-20 20:22:02,370 INFO L78 Accepts]: Start accepts. Automaton has 6868 states and 29534 transitions. Word has length 54 [2022-11-20 20:22:02,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:02,370 INFO L495 AbstractCegarLoop]: Abstraction has 6868 states and 29534 transitions. [2022-11-20 20:22:02,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:02,371 INFO L276 IsEmpty]: Start isEmpty. Operand 6868 states and 29534 transitions. [2022-11-20 20:22:02,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 20:22:02,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:02,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:02,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 20:22:02,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:02,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2126341667, now seen corresponding path program 1 times [2022-11-20 20:22:02,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:02,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003891635] [2022-11-20 20:22:02,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:02,710 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003891635] [2022-11-20 20:22:02,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003891635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:02,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924773459] [2022-11-20 20:22:02,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:02,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:02,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:02,718 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:02,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 20:22:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:02,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:22:02,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:03,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924773459] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:03,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1860936861] [2022-11-20 20:22:03,354 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:03,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:03,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-11-20 20:22:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626342607] [2022-11-20 20:22:03,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:03,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 20:22:03,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:03,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 20:22:03,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:22:03,363 INFO L87 Difference]: Start difference. First operand 6868 states and 29534 transitions. Second operand has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:03,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:03,892 INFO L93 Difference]: Finished difference Result 11572 states and 48055 transitions. [2022-11-20 20:22:03,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:22:03,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 20:22:03,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:03,938 INFO L225 Difference]: With dead ends: 11572 [2022-11-20 20:22:03,939 INFO L226 Difference]: Without dead ends: 11356 [2022-11-20 20:22:03,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-11-20 20:22:03,940 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 212 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:03,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 222 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-20 20:22:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11356 states. [2022-11-20 20:22:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11356 to 8502. [2022-11-20 20:22:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8502 states, 8501 states have (on average 4.26973297259146) internal successors, (36297), 8501 states have internal predecessors, (36297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:04,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8502 states to 8502 states and 36297 transitions. [2022-11-20 20:22:04,430 INFO L78 Accepts]: Start accepts. Automaton has 8502 states and 36297 transitions. Word has length 55 [2022-11-20 20:22:04,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:04,430 INFO L495 AbstractCegarLoop]: Abstraction has 8502 states and 36297 transitions. [2022-11-20 20:22:04,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.916666666666666) internal successors, (119), 11 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:04,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8502 states and 36297 transitions. [2022-11-20 20:22:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-20 20:22:04,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:04,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:04,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:04,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:04,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -786283212, now seen corresponding path program 1 times [2022-11-20 20:22:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:04,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627619405] [2022-11-20 20:22:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:05,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:05,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627619405] [2022-11-20 20:22:05,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627619405] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:05,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797853812] [2022-11-20 20:22:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:05,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:05,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:05,083 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:05,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 20:22:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:05,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-20 20:22:05,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:05,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:05,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:05,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797853812] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:05,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231237413] [2022-11-20 20:22:05,638 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:05,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:05,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 20:22:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213697041] [2022-11-20 20:22:05,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:05,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-20 20:22:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 20:22:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:22:05,642 INFO L87 Difference]: Start difference. First operand 8502 states and 36297 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:05,993 INFO L93 Difference]: Finished difference Result 8516 states and 33499 transitions. [2022-11-20 20:22:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 20:22:05,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-11-20 20:22:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:06,027 INFO L225 Difference]: With dead ends: 8516 [2022-11-20 20:22:06,027 INFO L226 Difference]: Without dead ends: 6407 [2022-11-20 20:22:06,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:22:06,028 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 281 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:06,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 106 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:22:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6407 states. [2022-11-20 20:22:06,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6407 to 6407. [2022-11-20 20:22:06,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6407 states, 6406 states have (on average 4.153137683421792) internal successors, (26605), 6406 states have internal predecessors, (26605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 26605 transitions. [2022-11-20 20:22:06,304 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 26605 transitions. Word has length 55 [2022-11-20 20:22:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:06,305 INFO L495 AbstractCegarLoop]: Abstraction has 6407 states and 26605 transitions. [2022-11-20 20:22:06,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 26605 transitions. [2022-11-20 20:22:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 20:22:06,329 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:06,329 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:06,345 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:06,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:06,546 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:06,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:06,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1708564349, now seen corresponding path program 2 times [2022-11-20 20:22:06,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:06,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408774962] [2022-11-20 20:22:06,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:06,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:06,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:06,909 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:06,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408774962] [2022-11-20 20:22:06,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408774962] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:06,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943412618] [2022-11-20 20:22:06,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:22:06,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:06,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:06,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:06,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 20:22:07,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:22:07,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:22:07,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:22:07,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:07,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:07,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943412618] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:07,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:22:07,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2022-11-20 20:22:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605037500] [2022-11-20 20:22:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:07,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:22:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:07,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:22:07,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-11-20 20:22:07,331 INFO L87 Difference]: Start difference. First operand 6407 states and 26605 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:07,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:07,564 INFO L93 Difference]: Finished difference Result 6455 states and 27235 transitions. [2022-11-20 20:22:07,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:22:07,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-20 20:22:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:07,593 INFO L225 Difference]: With dead ends: 6455 [2022-11-20 20:22:07,593 INFO L226 Difference]: Without dead ends: 6455 [2022-11-20 20:22:07,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:22:07,594 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 231 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:07,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 46 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-20 20:22:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6455 states. [2022-11-20 20:22:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6455 to 5703. [2022-11-20 20:22:07,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5703 states, 5702 states have (on average 4.283584707120308) internal successors, (24425), 5702 states have internal predecessors, (24425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:07,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 24425 transitions. [2022-11-20 20:22:07,898 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 24425 transitions. Word has length 56 [2022-11-20 20:22:07,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:07,898 INFO L495 AbstractCegarLoop]: Abstraction has 5703 states and 24425 transitions. [2022-11-20 20:22:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:07,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 24425 transitions. [2022-11-20 20:22:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 20:22:07,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:07,914 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:07,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:08,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 20:22:08,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:08,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:08,125 INFO L85 PathProgramCache]: Analyzing trace with hash -747093958, now seen corresponding path program 1 times [2022-11-20 20:22:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261247830] [2022-11-20 20:22:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:08,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:08,471 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:08,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261247830] [2022-11-20 20:22:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261247830] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888731410] [2022-11-20 20:22:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:08,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:08,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:08,473 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:08,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 20:22:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:08,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 20:22:08,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:08,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:22:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888731410] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:08,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 20:22:08,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2022-11-20 20:22:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175136059] [2022-11-20 20:22:08,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 20:22:08,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 20:22:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 20:22:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-20 20:22:08,937 INFO L87 Difference]: Start difference. First operand 5703 states and 24425 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:09,210 INFO L93 Difference]: Finished difference Result 6387 states and 27545 transitions. [2022-11-20 20:22:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-20 20:22:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-20 20:22:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:09,235 INFO L225 Difference]: With dead ends: 6387 [2022-11-20 20:22:09,235 INFO L226 Difference]: Without dead ends: 6387 [2022-11-20 20:22:09,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 105 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-11-20 20:22:09,236 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 145 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:09,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 49 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-20 20:22:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6387 states. [2022-11-20 20:22:09,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6387 to 6387. [2022-11-20 20:22:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6387 states, 6386 states have (on average 4.313341684935797) internal successors, (27545), 6386 states have internal predecessors, (27545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:09,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6387 states to 6387 states and 27545 transitions. [2022-11-20 20:22:09,529 INFO L78 Accepts]: Start accepts. Automaton has 6387 states and 27545 transitions. Word has length 56 [2022-11-20 20:22:09,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:09,530 INFO L495 AbstractCegarLoop]: Abstraction has 6387 states and 27545 transitions. [2022-11-20 20:22:09,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:09,531 INFO L276 IsEmpty]: Start isEmpty. Operand 6387 states and 27545 transitions. [2022-11-20 20:22:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:22:09,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:09,559 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:09,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 20:22:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:09,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:09,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash 526565857, now seen corresponding path program 1 times [2022-11-20 20:22:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:09,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226078511] [2022-11-20 20:22:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:09,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:11,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:11,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226078511] [2022-11-20 20:22:11,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226078511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:11,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068872777] [2022-11-20 20:22:11,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:11,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:11,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:11,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 20:22:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:11,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 20:22:11,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:12,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:12,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:12,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:22:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:12,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:12,623 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-11-20 20:22:12,652 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_495 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_495 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_495) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:22:12,668 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:12,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:22:12,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:22:12,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:12,704 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:22:12,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:22:12,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:22:12,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068872777] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:12,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1295557851] [2022-11-20 20:22:12,938 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:12,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:12,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-11-20 20:22:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315153488] [2022-11-20 20:22:12,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:12,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 20:22:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 20:22:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=360, Unknown=2, NotChecked=78, Total=506 [2022-11-20 20:22:12,941 INFO L87 Difference]: Start difference. First operand 6387 states and 27545 transitions. Second operand has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:14,810 INFO L93 Difference]: Finished difference Result 13020 states and 57913 transitions. [2022-11-20 20:22:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-20 20:22:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:22:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:14,859 INFO L225 Difference]: With dead ends: 13020 [2022-11-20 20:22:14,859 INFO L226 Difference]: Without dead ends: 12099 [2022-11-20 20:22:14,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=852, Unknown=2, NotChecked=126, Total=1190 [2022-11-20 20:22:14,861 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 467 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 1590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:14,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 401 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1590 Invalid, 0 Unknown, 395 Unchecked, 1.2s Time] [2022-11-20 20:22:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12099 states. [2022-11-20 20:22:15,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12099 to 7427. [2022-11-20 20:22:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7427 states, 7426 states have (on average 4.35591166172906) internal successors, (32347), 7426 states have internal predecessors, (32347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7427 states to 7427 states and 32347 transitions. [2022-11-20 20:22:15,162 INFO L78 Accepts]: Start accepts. Automaton has 7427 states and 32347 transitions. Word has length 58 [2022-11-20 20:22:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:15,163 INFO L495 AbstractCegarLoop]: Abstraction has 7427 states and 32347 transitions. [2022-11-20 20:22:15,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.136363636363637) internal successors, (113), 22 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7427 states and 32347 transitions. [2022-11-20 20:22:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:22:15,183 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:15,183 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:15,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:15,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:15,390 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:15,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:15,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2007082927, now seen corresponding path program 2 times [2022-11-20 20:22:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:15,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907553035] [2022-11-20 20:22:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:15,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:17,083 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:17,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907553035] [2022-11-20 20:22:17,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907553035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:17,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478096498] [2022-11-20 20:22:17,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:22:17,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:17,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:17,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:17,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 20:22:17,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:22:17,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:22:17,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:22:17,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:17,382 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:22:17,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:22:17,495 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:22:17,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:22:17,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:22:17,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:22:17,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:17,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:18,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 20:22:18,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:22:18,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:18,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:18,699 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 1))) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (<= c_~s_6~0 (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)))))) is different from false [2022-11-20 20:22:18,729 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_575 (Array Int Int)) (v_ArrVal_574 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_574) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_575) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:22:18,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:18,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-20 20:22:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 140 [2022-11-20 20:22:18,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-11-20 20:22:18,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:18,830 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:18,837 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:22:18,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:22:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:22:19,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478096498] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:19,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [715581288] [2022-11-20 20:22:19,333 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:19,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:19,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-20 20:22:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247053832] [2022-11-20 20:22:19,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:19,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 20:22:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:19,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 20:22:19,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=610, Unknown=7, NotChecked=102, Total=812 [2022-11-20 20:22:19,337 INFO L87 Difference]: Start difference. First operand 7427 states and 32347 transitions. Second operand has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:28,126 WARN L233 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 56 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:22:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:35,057 INFO L93 Difference]: Finished difference Result 16397 states and 72842 transitions. [2022-11-20 20:22:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 20:22:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:22:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:35,107 INFO L225 Difference]: With dead ends: 16397 [2022-11-20 20:22:35,107 INFO L226 Difference]: Without dead ends: 15515 [2022-11-20 20:22:35,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 103 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 2 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=438, Invalid=2113, Unknown=7, NotChecked=198, Total=2756 [2022-11-20 20:22:35,109 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 779 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 3790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1422 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:35,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 717 Invalid, 3790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2347 Invalid, 0 Unknown, 1422 Unchecked, 2.1s Time] [2022-11-20 20:22:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15515 states. [2022-11-20 20:22:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15515 to 8050. [2022-11-20 20:22:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8050 states, 8049 states have (on average 4.385637967449372) internal successors, (35300), 8049 states have internal predecessors, (35300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 35300 transitions. [2022-11-20 20:22:35,660 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 35300 transitions. Word has length 58 [2022-11-20 20:22:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:35,661 INFO L495 AbstractCegarLoop]: Abstraction has 8050 states and 35300 transitions. [2022-11-20 20:22:35,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 35300 transitions. [2022-11-20 20:22:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:22:35,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:35,683 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:35,712 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:35,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:35,889 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:35,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:35,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2068287604, now seen corresponding path program 1 times [2022-11-20 20:22:35,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:35,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417757796] [2022-11-20 20:22:35,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:35,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:37,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417757796] [2022-11-20 20:22:37,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417757796] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:37,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951002904] [2022-11-20 20:22:37,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:37,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:37,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:37,324 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:37,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 20:22:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:37,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:22:37,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:38,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:38,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:38,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:22:38,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:38,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:22:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:38,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:38,693 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))))) is different from false [2022-11-20 20:22:38,716 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_650 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_650) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_651) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:22:38,730 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:38,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-20 20:22:38,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-11-20 20:22:38,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-11-20 20:22:38,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:38,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:38,854 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:22:38,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:22:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:22:39,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951002904] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:39,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756943189] [2022-11-20 20:22:39,241 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:39,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:39,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-20 20:22:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878520895] [2022-11-20 20:22:39,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:39,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:22:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:22:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=644, Unknown=7, NotChecked=106, Total=870 [2022-11-20 20:22:39,243 INFO L87 Difference]: Start difference. First operand 8050 states and 35300 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:41,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:22:41,707 INFO L93 Difference]: Finished difference Result 13824 states and 61898 transitions. [2022-11-20 20:22:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:22:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:22:41,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:22:41,759 INFO L225 Difference]: With dead ends: 13824 [2022-11-20 20:22:41,759 INFO L226 Difference]: Without dead ends: 12943 [2022-11-20 20:22:41,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=367, Invalid=1439, Unknown=8, NotChecked=166, Total=1980 [2022-11-20 20:22:41,760 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 552 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 969 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:22:41,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 483 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1704 Invalid, 0 Unknown, 969 Unchecked, 1.4s Time] [2022-11-20 20:22:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12943 states. [2022-11-20 20:22:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12943 to 8715. [2022-11-20 20:22:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8715 states, 8714 states have (on average 4.406128069772779) internal successors, (38395), 8714 states have internal predecessors, (38395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 38395 transitions. [2022-11-20 20:22:42,149 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 38395 transitions. Word has length 58 [2022-11-20 20:22:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:22:42,149 INFO L495 AbstractCegarLoop]: Abstraction has 8715 states and 38395 transitions. [2022-11-20 20:22:42,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 38395 transitions. [2022-11-20 20:22:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:22:42,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:22:42,171 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:22:42,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 20:22:42,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:42,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:22:42,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:22:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash 502013827, now seen corresponding path program 3 times [2022-11-20 20:22:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:22:42,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701798641] [2022-11-20 20:22:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:22:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:22:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:22:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:22:43,755 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:22:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701798641] [2022-11-20 20:22:43,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701798641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:22:43,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118872626] [2022-11-20 20:22:43,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:22:43,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:22:43,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:22:43,757 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:22:43,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 20:22:43,995 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:22:43,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:22:43,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 85 conjunts are in the unsatisfiable core [2022-11-20 20:22:44,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:22:44,112 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:22:44,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:22:44,274 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:22:44,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:22:44,351 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 20:22:44,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 20:22:44,700 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-20 20:22:44,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2022-11-20 20:22:44,755 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 20:22:44,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 20:22:45,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:45,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:22:45,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:22:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:45,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:22:46,307 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:22:46,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-20 20:22:46,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 148 [2022-11-20 20:22:46,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-11-20 20:22:46,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:46,378 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:22:46,385 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:22:46,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:22:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:22:47,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118872626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:22:47,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [677942554] [2022-11-20 20:22:47,529 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:22:47,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:22:47,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 37 [2022-11-20 20:22:47,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154926796] [2022-11-20 20:22:47,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:22:47,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-20 20:22:47,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:22:47,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-20 20:22:47,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1310, Unknown=21, NotChecked=0, Total=1482 [2022-11-20 20:22:47,532 INFO L87 Difference]: Start difference. First operand 8715 states and 38395 transitions. Second operand has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:22:59,943 WARN L233 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:23:07,098 WARN L233 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 57 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:23:22,054 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 59 DAG size of output: 47 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:23:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:23:34,717 INFO L93 Difference]: Finished difference Result 30661 states and 130891 transitions. [2022-11-20 20:23:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-11-20 20:23:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:23:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:23:34,831 INFO L225 Difference]: With dead ends: 30661 [2022-11-20 20:23:34,831 INFO L226 Difference]: Without dead ends: 29699 [2022-11-20 20:23:34,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 107 SyntacticMatches, 15 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=743, Invalid=7471, Unknown=158, NotChecked=0, Total=8372 [2022-11-20 20:23:34,833 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 1129 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 6993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4299 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:23:34,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 1404 Invalid, 6993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2644 Invalid, 0 Unknown, 4299 Unchecked, 2.4s Time] [2022-11-20 20:23:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29699 states. [2022-11-20 20:23:35,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29699 to 9281. [2022-11-20 20:23:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9281 states, 9280 states have (on average 4.372306034482759) internal successors, (40575), 9280 states have internal predecessors, (40575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:23:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9281 states to 9281 states and 40575 transitions. [2022-11-20 20:23:35,433 INFO L78 Accepts]: Start accepts. Automaton has 9281 states and 40575 transitions. Word has length 58 [2022-11-20 20:23:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:23:35,434 INFO L495 AbstractCegarLoop]: Abstraction has 9281 states and 40575 transitions. [2022-11-20 20:23:35,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.8157894736842106) internal successors, (145), 38 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:23:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 9281 states and 40575 transitions. [2022-11-20 20:23:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:23:35,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:23:35,459 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:23:35,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-20 20:23:35,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 20:23:35,665 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:23:35,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:23:35,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1688169073, now seen corresponding path program 4 times [2022-11-20 20:23:35,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:23:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971367565] [2022-11-20 20:23:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:35,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:23:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:37,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:23:37,949 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:37,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971367565] [2022-11-20 20:23:37,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971367565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:23:37,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349774936] [2022-11-20 20:23:37,949 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:23:37,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:23:37,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:23:37,951 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:23:37,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 20:23:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:23:38,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:23:38,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:38,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:23:39,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:39,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:23:39,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:23:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:23:39,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:23:39,504 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_809 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 1))) (forall ((v_ArrVal_809 (Array Int Int))) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:23:39,615 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_809 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_809 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:23:39,656 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_808) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_809 (Array Int Int)) (v_ArrVal_808 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_808) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_809) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:23:39,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:39,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 180 [2022-11-20 20:23:39,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 70 [2022-11-20 20:23:39,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 126 [2022-11-20 20:23:39,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:39,740 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:39,750 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:23:39,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:23:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:23:40,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349774936] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:23:40,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2124517477] [2022-11-20 20:23:40,181 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:23:40,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:23:40,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2022-11-20 20:23:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104734565] [2022-11-20 20:23:40,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:23:40,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-20 20:23:40,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:23:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-20 20:23:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1047, Unknown=3, NotChecked=204, Total=1406 [2022-11-20 20:23:40,183 INFO L87 Difference]: Start difference. First operand 9281 states and 40575 transitions. Second operand has 38 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 37 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:23:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:23:46,815 INFO L93 Difference]: Finished difference Result 23696 states and 106157 transitions. [2022-11-20 20:23:46,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-20 20:23:46,816 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 37 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:23:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:23:46,883 INFO L225 Difference]: With dead ends: 23696 [2022-11-20 20:23:46,883 INFO L226 Difference]: Without dead ends: 22775 [2022-11-20 20:23:46,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 8 SemanticMatches, 67 ConstructedPredicates, 3 IntricatePredicates, 4 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=929, Invalid=3370, Unknown=3, NotChecked=390, Total=4692 [2022-11-20 20:23:46,885 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 1170 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 3029 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 3959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 3029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:23:46,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 726 Invalid, 3959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 3029 Invalid, 0 Unknown, 864 Unchecked, 2.9s Time] [2022-11-20 20:23:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22775 states. [2022-11-20 20:23:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22775 to 9392. [2022-11-20 20:23:47,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9392 states, 9391 states have (on average 4.361622830369503) internal successors, (40960), 9391 states have internal predecessors, (40960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:23:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9392 states to 9392 states and 40960 transitions. [2022-11-20 20:23:47,270 INFO L78 Accepts]: Start accepts. Automaton has 9392 states and 40960 transitions. Word has length 58 [2022-11-20 20:23:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:23:47,270 INFO L495 AbstractCegarLoop]: Abstraction has 9392 states and 40960 transitions. [2022-11-20 20:23:47,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.8378378378378377) internal successors, (142), 37 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:23:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 9392 states and 40960 transitions. [2022-11-20 20:23:47,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:23:47,289 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:23:47,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:23:47,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-20 20:23:47,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-20 20:23:47,496 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:23:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:23:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1468572308, now seen corresponding path program 2 times [2022-11-20 20:23:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:23:47,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561522895] [2022-11-20 20:23:47,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:23:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:23:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:23:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:23:49,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:23:49,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561522895] [2022-11-20 20:23:49,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561522895] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:23:49,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270325546] [2022-11-20 20:23:49,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:23:49,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:23:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:23:49,025 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:23:49,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-20 20:23:49,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:23:49,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:23:49,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:23:49,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:23:49,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:49,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:23:50,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:23:50,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:23:50,185 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:23:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:23:50,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:23:50,648 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_885 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_885) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_885 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_885) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:23:50,797 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:23:50,798 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 128 treesize of output 95 [2022-11-20 20:23:50,802 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 83 treesize of output 69 [2022-11-20 20:23:50,808 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 37 treesize of output 30 [2022-11-20 20:23:50,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:50,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:23:50,891 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:23:50,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:23:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:23:51,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270325546] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:23:51,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1748677885] [2022-11-20 20:23:51,297 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:23:51,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:23:51,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-20 20:23:51,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530205334] [2022-11-20 20:23:51,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:23:51,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:23:51,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:23:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:23:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=696, Unknown=9, NotChecked=54, Total=870 [2022-11-20 20:23:51,301 INFO L87 Difference]: Start difference. First operand 9392 states and 40960 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:25,901 WARN L233 SmtUtils]: Spent 33.11s on a formula simplification. DAG size of input: 48 DAG size of output: 44 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 20:24:27,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:27,264 INFO L93 Difference]: Finished difference Result 16353 states and 72799 transitions. [2022-11-20 20:24:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-20 20:24:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:24:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:27,310 INFO L225 Difference]: With dead ends: 16353 [2022-11-20 20:24:27,311 INFO L226 Difference]: Without dead ends: 16342 [2022-11-20 20:24:27,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 100 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=413, Invalid=1648, Unknown=13, NotChecked=88, Total=2162 [2022-11-20 20:24:27,312 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 648 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 2682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 892 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:27,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 538 Invalid, 2682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1773 Invalid, 0 Unknown, 892 Unchecked, 1.7s Time] [2022-11-20 20:24:27,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16342 states. [2022-11-20 20:24:27,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16342 to 10447. [2022-11-20 20:24:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10447 states, 10446 states have (on average 4.38483630097645) internal successors, (45804), 10446 states have internal predecessors, (45804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10447 states to 10447 states and 45804 transitions. [2022-11-20 20:24:27,603 INFO L78 Accepts]: Start accepts. Automaton has 10447 states and 45804 transitions. Word has length 58 [2022-11-20 20:24:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:27,604 INFO L495 AbstractCegarLoop]: Abstraction has 10447 states and 45804 transitions. [2022-11-20 20:24:27,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10447 states and 45804 transitions. [2022-11-20 20:24:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:24:27,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:27,628 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:27,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-20 20:24:27,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:24:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1083584653, now seen corresponding path program 1 times [2022-11-20 20:24:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:27,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991004882] [2022-11-20 20:24:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:27,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:29,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:24:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991004882] [2022-11-20 20:24:29,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991004882] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:24:29,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440582861] [2022-11-20 20:24:29,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:29,184 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:29,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-20 20:24:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:29,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:24:29,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:29,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:29,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:30,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:30,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:30,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:24:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:30,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:30,924 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_961) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_961) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:24:30,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_960) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_961) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_960 (Array Int Int)) (v_ArrVal_961 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_960) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_961) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:24:30,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:30,981 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 128 treesize of output 95 [2022-11-20 20:24:30,986 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 83 treesize of output 69 [2022-11-20 20:24:30,991 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 37 treesize of output 30 [2022-11-20 20:24:31,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:31,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:31,050 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:24:31,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:24:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:31,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440582861] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:24:31,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868522842] [2022-11-20 20:24:31,417 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:24:31,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:24:31,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-11-20 20:24:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644985273] [2022-11-20 20:24:31,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:31,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-20 20:24:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-20 20:24:31,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=649, Unknown=6, NotChecked=106, Total=870 [2022-11-20 20:24:31,421 INFO L87 Difference]: Start difference. First operand 10447 states and 45804 transitions. Second operand has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:34,119 INFO L93 Difference]: Finished difference Result 18845 states and 84057 transitions. [2022-11-20 20:24:34,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:24:34,119 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:24:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:34,173 INFO L225 Difference]: With dead ends: 18845 [2022-11-20 20:24:34,174 INFO L226 Difference]: Without dead ends: 17774 [2022-11-20 20:24:34,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=339, Invalid=1385, Unknown=6, NotChecked=162, Total=1892 [2022-11-20 20:24:34,175 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 749 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 862 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:34,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 516 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1598 Invalid, 0 Unknown, 862 Unchecked, 1.7s Time] [2022-11-20 20:24:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17774 states. [2022-11-20 20:24:34,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17774 to 10785. [2022-11-20 20:24:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10785 states, 10784 states have (on average 4.41941765578635) internal successors, (47659), 10784 states have internal predecessors, (47659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10785 states to 10785 states and 47659 transitions. [2022-11-20 20:24:34,539 INFO L78 Accepts]: Start accepts. Automaton has 10785 states and 47659 transitions. Word has length 58 [2022-11-20 20:24:34,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:34,540 INFO L495 AbstractCegarLoop]: Abstraction has 10785 states and 47659 transitions. [2022-11-20 20:24:34,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.689655172413793) internal successors, (136), 29 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10785 states and 47659 transitions. [2022-11-20 20:24:34,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:24:34,569 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:34,569 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:34,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:34,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:34,775 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:24:34,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:34,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1123086771, now seen corresponding path program 5 times [2022-11-20 20:24:34,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:34,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136361435] [2022-11-20 20:24:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:35,829 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:24:35,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136361435] [2022-11-20 20:24:35,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136361435] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:24:35,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402093513] [2022-11-20 20:24:35,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:24:35,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:35,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:35,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:35,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-20 20:24:36,101 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:24:36,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:24:36,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-20 20:24:36,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:36,146 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:24:36,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:24:36,231 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:24:36,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:24:36,283 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:24:36,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:24:36,413 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:24:36,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:24:36,438 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:24:36,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:24:36,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:36,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:24:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:36,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:37,249 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:37,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:24:37,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:24:37,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:37,275 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:24:37,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:24:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:37,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402093513] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:24:37,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111511940] [2022-11-20 20:24:37,849 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:24:37,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:24:37,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2022-11-20 20:24:37,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758701687] [2022-11-20 20:24:37,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:37,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-20 20:24:37,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:37,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 20:24:37,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=428, Unknown=11, NotChecked=0, Total=506 [2022-11-20 20:24:37,851 INFO L87 Difference]: Start difference. First operand 10785 states and 47659 transitions. Second operand has 23 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:40,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:40,284 INFO L93 Difference]: Finished difference Result 16719 states and 75072 transitions. [2022-11-20 20:24:40,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-20 20:24:40,285 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:24:40,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:40,336 INFO L225 Difference]: With dead ends: 16719 [2022-11-20 20:24:40,337 INFO L226 Difference]: Without dead ends: 15798 [2022-11-20 20:24:40,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=1176, Unknown=15, NotChecked=0, Total=1482 [2022-11-20 20:24:40,338 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 687 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1874 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:40,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 620 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1874 Invalid, 0 Unknown, 326 Unchecked, 1.7s Time] [2022-11-20 20:24:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15798 states. [2022-11-20 20:24:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15798 to 10970. [2022-11-20 20:24:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10970 states, 10969 states have (on average 4.430212416811013) internal successors, (48595), 10969 states have internal predecessors, (48595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 48595 transitions. [2022-11-20 20:24:40,742 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 48595 transitions. Word has length 58 [2022-11-20 20:24:40,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:40,743 INFO L495 AbstractCegarLoop]: Abstraction has 10970 states and 48595 transitions. [2022-11-20 20:24:40,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.318181818181818) internal successors, (117), 22 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:40,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 48595 transitions. [2022-11-20 20:24:40,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:24:40,770 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:40,770 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:40,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:40,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-20 20:24:40,971 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:24:40,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:40,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1988938719, now seen corresponding path program 6 times [2022-11-20 20:24:40,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097534640] [2022-11-20 20:24:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:41,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:24:41,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097534640] [2022-11-20 20:24:41,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097534640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:24:41,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024269487] [2022-11-20 20:24:41,999 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:24:41,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:41,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:42,000 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:42,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-20 20:24:42,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:24:42,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:24:42,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 20:24:42,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:42,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:42,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:42,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:24:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:42,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:43,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:43,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:24:43,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:24:43,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:43,181 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:24:43,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:24:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:43,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024269487] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:24:43,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1731821390] [2022-11-20 20:24:43,493 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:24:43,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:24:43,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2022-11-20 20:24:43,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813904467] [2022-11-20 20:24:43,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:43,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-20 20:24:43,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:43,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-20 20:24:43,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=387, Unknown=5, NotChecked=0, Total=462 [2022-11-20 20:24:43,497 INFO L87 Difference]: Start difference. First operand 10970 states and 48595 transitions. Second operand has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:45,592 INFO L93 Difference]: Finished difference Result 16739 states and 75130 transitions. [2022-11-20 20:24:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:24:45,592 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:24:45,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:45,654 INFO L225 Difference]: With dead ends: 16739 [2022-11-20 20:24:45,654 INFO L226 Difference]: Without dead ends: 15806 [2022-11-20 20:24:45,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=848, Unknown=5, NotChecked=0, Total=1056 [2022-11-20 20:24:45,656 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 571 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:45,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 439 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1604 Invalid, 0 Unknown, 99 Unchecked, 1.5s Time] [2022-11-20 20:24:45,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15806 states. [2022-11-20 20:24:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15806 to 11286. [2022-11-20 20:24:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11286 states, 11285 states have (on average 4.433229951262738) internal successors, (50029), 11285 states have internal predecessors, (50029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11286 states to 11286 states and 50029 transitions. [2022-11-20 20:24:46,100 INFO L78 Accepts]: Start accepts. Automaton has 11286 states and 50029 transitions. Word has length 58 [2022-11-20 20:24:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:46,100 INFO L495 AbstractCegarLoop]: Abstraction has 11286 states and 50029 transitions. [2022-11-20 20:24:46,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.0) internal successors, (105), 21 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:46,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11286 states and 50029 transitions. [2022-11-20 20:24:46,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:24:46,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:46,130 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:46,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:46,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-20 20:24:46,336 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:24:46,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:46,337 INFO L85 PathProgramCache]: Analyzing trace with hash 658175327, now seen corresponding path program 7 times [2022-11-20 20:24:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:46,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467865676] [2022-11-20 20:24:46,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:46,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:47,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:24:47,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467865676] [2022-11-20 20:24:47,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467865676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:24:47,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061989300] [2022-11-20 20:24:47,689 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:24:47,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:47,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:47,690 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:47,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-20 20:24:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:47,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:24:47,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:48,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:48,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:48,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:48,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:48,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:24:48,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:48,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:49,126 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1193 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1193) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_1193 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1193) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:24:49,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:49,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-20 20:24:49,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 148 [2022-11-20 20:24:49,305 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 134 [2022-11-20 20:24:49,438 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:49,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:49,451 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:24:49,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:24:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:49,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061989300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:24:49,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [781944823] [2022-11-20 20:24:49,947 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:24:49,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:24:49,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-20 20:24:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903126190] [2022-11-20 20:24:49,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:49,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:24:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:24:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=4, NotChecked=50, Total=756 [2022-11-20 20:24:49,950 INFO L87 Difference]: Start difference. First operand 11286 states and 50029 transitions. Second operand has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:24:52,839 INFO L93 Difference]: Finished difference Result 17589 states and 79098 transitions. [2022-11-20 20:24:52,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 20:24:52,840 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:24:52,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:24:52,909 INFO L225 Difference]: With dead ends: 17589 [2022-11-20 20:24:52,910 INFO L226 Difference]: Without dead ends: 16788 [2022-11-20 20:24:52,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=359, Invalid=1363, Unknown=4, NotChecked=80, Total=1806 [2022-11-20 20:24:52,911 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 611 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 2413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:24:52,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 553 Invalid, 2413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2001 Invalid, 0 Unknown, 400 Unchecked, 1.9s Time] [2022-11-20 20:24:52,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16788 states. [2022-11-20 20:24:53,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16788 to 11372. [2022-11-20 20:24:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11372 states, 11371 states have (on average 4.436988831237358) internal successors, (50453), 11371 states have internal predecessors, (50453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:53,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 50453 transitions. [2022-11-20 20:24:53,305 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 50453 transitions. Word has length 58 [2022-11-20 20:24:53,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:24:53,306 INFO L495 AbstractCegarLoop]: Abstraction has 11372 states and 50453 transitions. [2022-11-20 20:24:53,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:24:53,306 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 50453 transitions. [2022-11-20 20:24:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:24:53,335 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:24:53,335 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:24:53,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-20 20:24:53,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-20 20:24:53,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:24:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:24:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -306655221, now seen corresponding path program 8 times [2022-11-20 20:24:53,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:24:53,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933547076] [2022-11-20 20:24:53,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:24:53,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:24:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:24:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:54,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:24:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933547076] [2022-11-20 20:24:54,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933547076] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:24:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799159281] [2022-11-20 20:24:54,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:24:54,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:24:54,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:24:54,956 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:24:54,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-20 20:24:55,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:24:55,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:24:55,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:24:55,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:24:55,482 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:24:55,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:24:55,603 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:24:55,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:24:55,629 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:24:55,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:24:56,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:24:56,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:56,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:24:56,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:24:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:56,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:24:57,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:24:57,081 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 128 treesize of output 95 [2022-11-20 20:24:57,086 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 83 treesize of output 69 [2022-11-20 20:24:57,100 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 37 treesize of output 30 [2022-11-20 20:24:57,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:57,173 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:24:57,184 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:24:57,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:24:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:24:57,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799159281] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:24:57,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [493462513] [2022-11-20 20:24:57,780 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:24:57,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:24:57,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-20 20:24:57,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673841135] [2022-11-20 20:24:57,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:24:57,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:24:57,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:24:57,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:24:57,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=650, Unknown=10, NotChecked=0, Total=756 [2022-11-20 20:24:57,784 INFO L87 Difference]: Start difference. First operand 11372 states and 50453 transitions. Second operand has 28 states, 27 states have (on average 4.407407407407407) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:00,929 INFO L93 Difference]: Finished difference Result 17371 states and 78047 transitions. [2022-11-20 20:25:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 20:25:00,930 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.407407407407407) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:00,980 INFO L225 Difference]: With dead ends: 17371 [2022-11-20 20:25:00,980 INFO L226 Difference]: Without dead ends: 16570 [2022-11-20 20:25:00,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 98 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=383, Invalid=1862, Unknown=11, NotChecked=0, Total=2256 [2022-11-20 20:25:00,981 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1088 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 894 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:00,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 585 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1975 Invalid, 0 Unknown, 894 Unchecked, 2.0s Time] [2022-11-20 20:25:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16570 states. [2022-11-20 20:25:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16570 to 11285. [2022-11-20 20:25:01,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11285 states, 11284 states have (on average 4.431230060262318) internal successors, (50002), 11284 states have internal predecessors, (50002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11285 states to 11285 states and 50002 transitions. [2022-11-20 20:25:01,257 INFO L78 Accepts]: Start accepts. Automaton has 11285 states and 50002 transitions. Word has length 58 [2022-11-20 20:25:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:01,257 INFO L495 AbstractCegarLoop]: Abstraction has 11285 states and 50002 transitions. [2022-11-20 20:25:01,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.407407407407407) internal successors, (119), 27 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11285 states and 50002 transitions. [2022-11-20 20:25:01,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:01,278 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:01,278 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:01,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:01,478 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:01,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1481044152, now seen corresponding path program 3 times [2022-11-20 20:25:01,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:01,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818523465] [2022-11-20 20:25:01,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:02,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:02,584 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818523465] [2022-11-20 20:25:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818523465] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135415263] [2022-11-20 20:25:02,584 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:25:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:02,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:02,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:02,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-20 20:25:02,855 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:25:02,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:02,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:25:02,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:03,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:03,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:03,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:03,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:03,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:03,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:03,873 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (+ c_~s_6~0 c_~t_8~0))) (and (forall ((v_ArrVal_1349 (Array Int Int))) (< .cse0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1349) c_~X_0~0.base) .cse1) 1 c_~s_2~0))) (forall ((v_ArrVal_1349 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1349) c_~X_0~0.base) .cse1) c_~s_2~0) .cse0)))) is different from false [2022-11-20 20:25:03,950 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse0 (+ c_~s_6~0 c_~t_8~0))) (and (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int))) (< .cse0 (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1348) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1349) c_~X_0~0.base) .cse1) 1 c_~s_2~0))) (forall ((v_ArrVal_1349 (Array Int Int)) (v_ArrVal_1348 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1348) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1349) c_~X_0~0.base) .cse1) c_~s_2~0) .cse0)))) is different from false [2022-11-20 20:25:03,967 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:03,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 266 treesize of output 188 [2022-11-20 20:25:03,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 162 [2022-11-20 20:25:03,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 134 [2022-11-20 20:25:04,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:04,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:04,071 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:25:04,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:25:04,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:04,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135415263] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:04,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375331093] [2022-11-20 20:25:04,489 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:04,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:04,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-20 20:25:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836184010] [2022-11-20 20:25:04,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:25:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:25:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=554, Unknown=2, NotChecked=98, Total=756 [2022-11-20 20:25:04,491 INFO L87 Difference]: Start difference. First operand 11285 states and 50002 transitions. Second operand has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:07,093 INFO L93 Difference]: Finished difference Result 15938 states and 71437 transitions. [2022-11-20 20:25:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:25:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:07,139 INFO L225 Difference]: With dead ends: 15938 [2022-11-20 20:25:07,139 INFO L226 Difference]: Without dead ends: 15189 [2022-11-20 20:25:07,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=1250, Unknown=2, NotChecked=154, Total=1722 [2022-11-20 20:25:07,140 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 501 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 2574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 543 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:07,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 496 Invalid, 2574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2018 Invalid, 0 Unknown, 543 Unchecked, 1.8s Time] [2022-11-20 20:25:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15189 states. [2022-11-20 20:25:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15189 to 11397. [2022-11-20 20:25:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11397 states, 11396 states have (on average 4.436819936819937) internal successors, (50562), 11396 states have internal predecessors, (50562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11397 states to 11397 states and 50562 transitions. [2022-11-20 20:25:07,423 INFO L78 Accepts]: Start accepts. Automaton has 11397 states and 50562 transitions. Word has length 58 [2022-11-20 20:25:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:07,424 INFO L495 AbstractCegarLoop]: Abstraction has 11397 states and 50562 transitions. [2022-11-20 20:25:07,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:07,424 INFO L276 IsEmpty]: Start isEmpty. Operand 11397 states and 50562 transitions. [2022-11-20 20:25:07,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:07,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:07,445 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:07,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-11-20 20:25:07,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:07,646 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:07,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:07,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1359016328, now seen corresponding path program 4 times [2022-11-20 20:25:07,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:07,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836392545] [2022-11-20 20:25:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:07,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:08,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:08,692 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:08,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836392545] [2022-11-20 20:25:08,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836392545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:08,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294824881] [2022-11-20 20:25:08,692 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:25:08,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:08,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:08,693 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:08,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-20 20:25:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:08,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-20 20:25:08,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:09,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:09,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:09,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:09,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:09,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:09,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:09,997 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1425 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1425) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_1425 (Array Int Int))) (< (+ c_~s_2~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1425) c_~X_0~0.base) .cse0)) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:25:10,071 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1424) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1425) c_~X_0~0.base) .cse0) c_~s_2~0))) (forall ((v_ArrVal_1425 (Array Int Int)) (v_ArrVal_1424 (Array Int Int))) (< (+ (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1424) |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1425) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))))) is different from false [2022-11-20 20:25:10,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:10,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 188 [2022-11-20 20:25:10,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2022-11-20 20:25:10,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 134 [2022-11-20 20:25:10,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:10,160 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:10,169 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:25:10,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:25:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:10,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294824881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:10,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1915619330] [2022-11-20 20:25:10,556 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:10,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:10,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-20 20:25:10,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187323990] [2022-11-20 20:25:10,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:10,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:25:10,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:10,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:25:10,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=554, Unknown=2, NotChecked=98, Total=756 [2022-11-20 20:25:10,559 INFO L87 Difference]: Start difference. First operand 11397 states and 50562 transitions. Second operand has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:12,759 INFO L93 Difference]: Finished difference Result 16072 states and 72198 transitions. [2022-11-20 20:25:12,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 20:25:12,759 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:12,806 INFO L225 Difference]: With dead ends: 16072 [2022-11-20 20:25:12,806 INFO L226 Difference]: Without dead ends: 15171 [2022-11-20 20:25:12,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=306, Invalid=1182, Unknown=2, NotChecked=150, Total=1640 [2022-11-20 20:25:12,807 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 604 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 500 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:12,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 387 Invalid, 2003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1488 Invalid, 0 Unknown, 500 Unchecked, 1.4s Time] [2022-11-20 20:25:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15171 states. [2022-11-20 20:25:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15171 to 11377. [2022-11-20 20:25:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11377 states, 11376 states have (on average 4.436884669479606) internal successors, (50474), 11376 states have internal predecessors, (50474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11377 states to 11377 states and 50474 transitions. [2022-11-20 20:25:13,083 INFO L78 Accepts]: Start accepts. Automaton has 11377 states and 50474 transitions. Word has length 58 [2022-11-20 20:25:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:13,083 INFO L495 AbstractCegarLoop]: Abstraction has 11377 states and 50474 transitions. [2022-11-20 20:25:13,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 11377 states and 50474 transitions. [2022-11-20 20:25:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:13,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:13,106 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:13,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:13,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:13,307 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:13,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1199904665, now seen corresponding path program 2 times [2022-11-20 20:25:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:13,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459578919] [2022-11-20 20:25:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:14,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459578919] [2022-11-20 20:25:14,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459578919] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:14,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230817878] [2022-11-20 20:25:14,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:25:14,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:14,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:14,619 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:14,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 20:25:14,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:25:14,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:14,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:25:14,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:14,904 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:25:14,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:25:15,004 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:25:15,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:25:15,049 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:25:15,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:25:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:15,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:15,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-20 20:25:15,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:25:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:16,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:16,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1505 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1505) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_1505 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1505) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:25:16,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:16,572 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 128 treesize of output 95 [2022-11-20 20:25:16,576 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 83 treesize of output 69 [2022-11-20 20:25:16,583 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 37 treesize of output 30 [2022-11-20 20:25:16,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:16,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:16,645 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:25:16,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-11-20 20:25:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:17,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230817878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1693248102] [2022-11-20 20:25:17,206 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:17,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:17,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 27 [2022-11-20 20:25:17,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033175832] [2022-11-20 20:25:17,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:17,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 20:25:17,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:17,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 20:25:17,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=655, Unknown=12, NotChecked=52, Total=812 [2022-11-20 20:25:17,212 INFO L87 Difference]: Start difference. First operand 11377 states and 50474 transitions. Second operand has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:21,116 INFO L93 Difference]: Finished difference Result 17144 states and 76972 transitions. [2022-11-20 20:25:21,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:25:21,116 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:21,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:21,165 INFO L225 Difference]: With dead ends: 17144 [2022-11-20 20:25:21,165 INFO L226 Difference]: Without dead ends: 16094 [2022-11-20 20:25:21,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=464, Invalid=1978, Unknown=12, NotChecked=96, Total=2550 [2022-11-20 20:25:21,166 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1036 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 3563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1077 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:21,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 658 Invalid, 3563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2452 Invalid, 0 Unknown, 1077 Unchecked, 2.4s Time] [2022-11-20 20:25:21,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2022-11-20 20:25:21,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 9884. [2022-11-20 20:25:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9884 states, 9883 states have (on average 4.398158453910756) internal successors, (43467), 9883 states have internal predecessors, (43467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9884 states to 9884 states and 43467 transitions. [2022-11-20 20:25:21,464 INFO L78 Accepts]: Start accepts. Automaton has 9884 states and 43467 transitions. Word has length 58 [2022-11-20 20:25:21,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:21,465 INFO L495 AbstractCegarLoop]: Abstraction has 9884 states and 43467 transitions. [2022-11-20 20:25:21,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.607142857142857) internal successors, (129), 28 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 9884 states and 43467 transitions. [2022-11-20 20:25:21,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:21,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:21,482 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:21,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:21,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-20 20:25:21,683 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:21,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1797246803, now seen corresponding path program 9 times [2022-11-20 20:25:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:21,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777056659] [2022-11-20 20:25:21,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:21,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:22,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:22,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777056659] [2022-11-20 20:25:22,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777056659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:22,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56286790] [2022-11-20 20:25:22,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:25:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:22,771 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:22,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-20 20:25:23,017 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:25:23,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:23,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-20 20:25:23,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:23,060 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:25:23,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:25:23,157 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:25:23,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:25:23,176 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:25:23,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:25:23,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:23,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:23,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:23,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:23,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:24,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_1585 (Array Int Int))) (< (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1585) c_~X_0~0.base) .cse0) c_~s_2~0) (+ c_~s_6~0 c_~t_8~0 1))) (forall ((v_ArrVal_1585 (Array Int Int))) (<= (+ c_~s_6~0 c_~t_8~0) (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_1585) c_~X_0~0.base) .cse0) c_~s_2~0))))) is different from false [2022-11-20 20:25:24,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:24,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 91 [2022-11-20 20:25:24,258 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 79 treesize of output 65 [2022-11-20 20:25:24,264 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 35 treesize of output 28 [2022-11-20 20:25:24,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:24,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 20:25:24,327 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:25:24,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 13 [2022-11-20 20:25:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:24,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56286790] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:24,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1649805724] [2022-11-20 20:25:24,823 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:24,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:24,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2022-11-20 20:25:24,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784681569] [2022-11-20 20:25:24,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:24,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-20 20:25:24,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:24,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-20 20:25:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=607, Unknown=8, NotChecked=50, Total=756 [2022-11-20 20:25:24,826 INFO L87 Difference]: Start difference. First operand 9884 states and 43467 transitions. Second operand has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 27 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:27,816 INFO L93 Difference]: Finished difference Result 15665 states and 70098 transitions. [2022-11-20 20:25:27,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:25:27,817 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 27 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:27,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:27,864 INFO L225 Difference]: With dead ends: 15665 [2022-11-20 20:25:27,864 INFO L226 Difference]: Without dead ends: 14976 [2022-11-20 20:25:27,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 97 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=367, Invalid=1695, Unknown=12, NotChecked=88, Total=2162 [2022-11-20 20:25:27,865 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 848 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:27,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 609 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2041 Invalid, 0 Unknown, 673 Unchecked, 1.9s Time] [2022-11-20 20:25:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14976 states. [2022-11-20 20:25:28,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14976 to 9756. [2022-11-20 20:25:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9756 states, 9755 states have (on average 4.388416196822143) internal successors, (42809), 9755 states have internal predecessors, (42809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9756 states to 9756 states and 42809 transitions. [2022-11-20 20:25:28,119 INFO L78 Accepts]: Start accepts. Automaton has 9756 states and 42809 transitions. Word has length 58 [2022-11-20 20:25:28,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:28,120 INFO L495 AbstractCegarLoop]: Abstraction has 9756 states and 42809 transitions. [2022-11-20 20:25:28,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.555555555555555) internal successors, (123), 27 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 9756 states and 42809 transitions. [2022-11-20 20:25:28,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:28,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:28,145 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:28,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:28,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:28,346 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:28,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1577924917, now seen corresponding path program 1 times [2022-11-20 20:25:28,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:28,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563613447] [2022-11-20 20:25:28,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:28,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:29,130 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563613447] [2022-11-20 20:25:29,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563613447] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:29,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056722265] [2022-11-20 20:25:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:29,132 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:29,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-20 20:25:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:29,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:25:29,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:29,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:29,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:29,935 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:29,936 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 25 treesize of output 20 [2022-11-20 20:25:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:30,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056722265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:30,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [929644277] [2022-11-20 20:25:30,066 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:30,067 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:30,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 16 [2022-11-20 20:25:30,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236225595] [2022-11-20 20:25:30,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:30,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 20:25:30,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 20:25:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:25:30,068 INFO L87 Difference]: Start difference. First operand 9756 states and 42809 transitions. Second operand has 17 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:31,733 INFO L93 Difference]: Finished difference Result 15051 states and 67173 transitions. [2022-11-20 20:25:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:25:31,734 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:31,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:31,781 INFO L225 Difference]: With dead ends: 15051 [2022-11-20 20:25:31,781 INFO L226 Difference]: Without dead ends: 14314 [2022-11-20 20:25:31,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2022-11-20 20:25:31,782 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 368 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:31,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 467 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-20 20:25:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14314 states. [2022-11-20 20:25:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14314 to 9998. [2022-11-20 20:25:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9998 states, 9997 states have (on average 4.38851655496649) internal successors, (43872), 9997 states have internal predecessors, (43872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:32,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9998 states to 9998 states and 43872 transitions. [2022-11-20 20:25:32,038 INFO L78 Accepts]: Start accepts. Automaton has 9998 states and 43872 transitions. Word has length 58 [2022-11-20 20:25:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:32,039 INFO L495 AbstractCegarLoop]: Abstraction has 9998 states and 43872 transitions. [2022-11-20 20:25:32,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.375) internal successors, (102), 17 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:32,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9998 states and 43872 transitions. [2022-11-20 20:25:32,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:32,057 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:32,057 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:32,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:32,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-20 20:25:32,258 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash -955723867, now seen corresponding path program 2 times [2022-11-20 20:25:32,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:32,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952451956] [2022-11-20 20:25:32,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:32,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:33,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:33,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952451956] [2022-11-20 20:25:33,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952451956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:33,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227805685] [2022-11-20 20:25:33,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:25:33,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:33,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:33,245 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:33,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-20 20:25:33,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:25:33,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:33,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 20:25:33,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:33,563 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:25:33,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:25:33,731 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:25:33,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:25:33,776 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:25:33,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:25:34,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:34,739 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:34,740 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 17 treesize of output 17 [2022-11-20 20:25:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:25:34,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:38,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:38,634 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 56 treesize of output 44 [2022-11-20 20:25:38,640 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 17 treesize of output 11 [2022-11-20 20:25:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:25:39,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227805685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:39,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [40657638] [2022-11-20 20:25:39,741 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:39,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:39,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 35 [2022-11-20 20:25:39,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618288765] [2022-11-20 20:25:39,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:39,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-20 20:25:39,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:39,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-20 20:25:39,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1169, Unknown=9, NotChecked=0, Total=1332 [2022-11-20 20:25:39,743 INFO L87 Difference]: Start difference. First operand 9998 states and 43872 transitions. Second operand has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:45,347 INFO L93 Difference]: Finished difference Result 19141 states and 86164 transitions. [2022-11-20 20:25:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 20:25:45,347 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:45,405 INFO L225 Difference]: With dead ends: 19141 [2022-11-20 20:25:45,405 INFO L226 Difference]: Without dead ends: 18500 [2022-11-20 20:25:45,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1338 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=796, Invalid=4451, Unknown=9, NotChecked=0, Total=5256 [2022-11-20 20:25:45,409 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 1273 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1512 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:45,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 1018 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2846 Invalid, 0 Unknown, 1512 Unchecked, 2.7s Time] [2022-11-20 20:25:45,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18500 states. [2022-11-20 20:25:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18500 to 9854. [2022-11-20 20:25:45,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9854 states, 9853 states have (on average 4.393788693798843) internal successors, (43292), 9853 states have internal predecessors, (43292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 43292 transitions. [2022-11-20 20:25:45,687 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 43292 transitions. Word has length 58 [2022-11-20 20:25:45,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:45,688 INFO L495 AbstractCegarLoop]: Abstraction has 9854 states and 43292 transitions. [2022-11-20 20:25:45,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 4.138888888888889) internal successors, (149), 36 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 43292 transitions. [2022-11-20 20:25:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:45,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:45,707 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:45,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:45,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-20 20:25:45,907 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1175320632, now seen corresponding path program 1 times [2022-11-20 20:25:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764014382] [2022-11-20 20:25:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:46,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764014382] [2022-11-20 20:25:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764014382] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:46,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156854332] [2022-11-20 20:25:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:46,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:46,890 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:46,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-20 20:25:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:47,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 20:25:47,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:47,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:25:47,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:25:47,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:48,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:48,094 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1813 (Array Int Int))) (= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_1813) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) is different from false [2022-11-20 20:25:48,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:48,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:25:48,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:25:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:25:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156854332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1878476970] [2022-11-20 20:25:48,574 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:48,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:48,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 25 [2022-11-20 20:25:48,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737202945] [2022-11-20 20:25:48,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:48,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 20:25:48,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:48,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 20:25:48,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=528, Unknown=5, NotChecked=48, Total=702 [2022-11-20 20:25:48,577 INFO L87 Difference]: Start difference. First operand 9854 states and 43292 transitions. Second operand has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:51,165 INFO L93 Difference]: Finished difference Result 14757 states and 65760 transitions. [2022-11-20 20:25:51,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:25:51,165 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:51,206 INFO L225 Difference]: With dead ends: 14757 [2022-11-20 20:25:51,207 INFO L226 Difference]: Without dead ends: 14052 [2022-11-20 20:25:51,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 98 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=348, Invalid=1210, Unknown=6, NotChecked=76, Total=1640 [2022-11-20 20:25:51,208 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 751 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 1903 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:51,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 462 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1903 Invalid, 0 Unknown, 768 Unchecked, 1.7s Time] [2022-11-20 20:25:51,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14052 states. [2022-11-20 20:25:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14052 to 9854. [2022-11-20 20:25:51,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9854 states, 9853 states have (on average 4.393788693798843) internal successors, (43292), 9853 states have internal predecessors, (43292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9854 states to 9854 states and 43292 transitions. [2022-11-20 20:25:51,436 INFO L78 Accepts]: Start accepts. Automaton has 9854 states and 43292 transitions. Word has length 58 [2022-11-20 20:25:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:51,436 INFO L495 AbstractCegarLoop]: Abstraction has 9854 states and 43292 transitions. [2022-11-20 20:25:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 5.230769230769231) internal successors, (136), 26 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 9854 states and 43292 transitions. [2022-11-20 20:25:51,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:51,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:51,454 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:51,459 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-20 20:25:51,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:51,655 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:51,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 343935151, now seen corresponding path program 3 times [2022-11-20 20:25:51,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707048543] [2022-11-20 20:25:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:52,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:52,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707048543] [2022-11-20 20:25:52,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707048543] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:52,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550713105] [2022-11-20 20:25:52,385 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:25:52,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:52,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:52,388 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:52,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 20:25:52,681 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:25:52,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:52,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:25:52,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:52,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:53,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:53,134 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:53,135 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 25 treesize of output 20 [2022-11-20 20:25:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:53,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550713105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:53,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [8270155] [2022-11-20 20:25:53,244 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:53,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:53,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-11-20 20:25:53,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050263418] [2022-11-20 20:25:53,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:53,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:25:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:25:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:25:53,246 INFO L87 Difference]: Start difference. First operand 9854 states and 43292 transitions. Second operand has 16 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:54,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:54,494 INFO L93 Difference]: Finished difference Result 14603 states and 65335 transitions. [2022-11-20 20:25:54,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:25:54,495 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:54,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:54,537 INFO L225 Difference]: With dead ends: 14603 [2022-11-20 20:25:54,537 INFO L226 Difference]: Without dead ends: 13866 [2022-11-20 20:25:54,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:25:54,538 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 441 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:54,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 354 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 20:25:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13866 states. [2022-11-20 20:25:54,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13866 to 10008. [2022-11-20 20:25:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10008 states, 10007 states have (on average 4.404217048066354) internal successors, (44073), 10007 states have internal predecessors, (44073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10008 states to 10008 states and 44073 transitions. [2022-11-20 20:25:54,778 INFO L78 Accepts]: Start accepts. Automaton has 10008 states and 44073 transitions. Word has length 58 [2022-11-20 20:25:54,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:54,778 INFO L495 AbstractCegarLoop]: Abstraction has 10008 states and 44073 transitions. [2022-11-20 20:25:54,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 16 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 10008 states and 44073 transitions. [2022-11-20 20:25:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:54,797 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:54,797 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:54,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:54,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-20 20:25:54,998 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:54,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:54,998 INFO L85 PathProgramCache]: Analyzing trace with hash 886149461, now seen corresponding path program 4 times [2022-11-20 20:25:54,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990143339] [2022-11-20 20:25:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:54,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:55,776 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:55,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990143339] [2022-11-20 20:25:55,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990143339] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:55,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834249283] [2022-11-20 20:25:55,777 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:25:55,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:55,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:55,778 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:55,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 20:25:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:56,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:25:56,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:56,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:25:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:56,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:25:56,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:25:56,498 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 25 treesize of output 20 [2022-11-20 20:25:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:56,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834249283] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:25:56,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1210487436] [2022-11-20 20:25:56,611 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:25:56,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:25:56,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-11-20 20:25:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332527522] [2022-11-20 20:25:56,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:25:56,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:25:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:25:56,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:25:56,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:25:56,613 INFO L87 Difference]: Start difference. First operand 10008 states and 44073 transitions. Second operand has 16 states, 15 states have (on average 6.6) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:25:57,852 INFO L93 Difference]: Finished difference Result 14775 states and 66224 transitions. [2022-11-20 20:25:57,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:25:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:25:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:25:57,895 INFO L225 Difference]: With dead ends: 14775 [2022-11-20 20:25:57,895 INFO L226 Difference]: Without dead ends: 13872 [2022-11-20 20:25:57,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=546, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:25:57,896 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 479 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:25:57,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 383 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 20:25:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13872 states. [2022-11-20 20:25:58,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13872 to 10096. [2022-11-20 20:25:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10096 states, 10095 states have (on average 4.4107974244675585) internal successors, (44527), 10095 states have internal predecessors, (44527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:58,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10096 states to 10096 states and 44527 transitions. [2022-11-20 20:25:58,134 INFO L78 Accepts]: Start accepts. Automaton has 10096 states and 44527 transitions. Word has length 58 [2022-11-20 20:25:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:25:58,134 INFO L495 AbstractCegarLoop]: Abstraction has 10096 states and 44527 transitions. [2022-11-20 20:25:58,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.6) internal successors, (99), 16 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:25:58,134 INFO L276 IsEmpty]: Start isEmpty. Operand 10096 states and 44527 transitions. [2022-11-20 20:25:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:25:58,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:25:58,152 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:25:58,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-20 20:25:58,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-20 20:25:58,353 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:25:58,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:25:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1468044963, now seen corresponding path program 5 times [2022-11-20 20:25:58,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:25:58,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711842558] [2022-11-20 20:25:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:25:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:25:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:25:59,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:25:59,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:25:59,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711842558] [2022-11-20 20:25:59,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711842558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:25:59,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838100789] [2022-11-20 20:25:59,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:25:59,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:25:59,241 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:25:59,242 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:25:59,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 20:25:59,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:25:59,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:25:59,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-20 20:25:59,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:25:59,601 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:25:59,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:25:59,820 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:25:59,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:25:59,847 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:25:59,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:00,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:26:00,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:00,720 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 17 treesize of output 17 [2022-11-20 20:26:00,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:00,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:02,856 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:02,857 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 56 treesize of output 44 [2022-11-20 20:26:02,864 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 17 treesize of output 11 [2022-11-20 20:26:03,914 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:03,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838100789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:03,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1807304360] [2022-11-20 20:26:03,915 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:03,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:03,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 34 [2022-11-20 20:26:03,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301434286] [2022-11-20 20:26:03,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:03,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-20 20:26:03,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-20 20:26:03,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1101, Unknown=4, NotChecked=0, Total=1260 [2022-11-20 20:26:03,918 INFO L87 Difference]: Start difference. First operand 10096 states and 44527 transitions. Second operand has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:08,043 INFO L93 Difference]: Finished difference Result 15381 states and 69182 transitions. [2022-11-20 20:26:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-20 20:26:08,043 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:08,088 INFO L225 Difference]: With dead ends: 15381 [2022-11-20 20:26:08,088 INFO L226 Difference]: Without dead ends: 14740 [2022-11-20 20:26:08,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=702, Invalid=3200, Unknown=4, NotChecked=0, Total=3906 [2022-11-20 20:26:08,089 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1372 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:08,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 818 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2553 Invalid, 0 Unknown, 732 Unchecked, 2.4s Time] [2022-11-20 20:26:08,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14740 states. [2022-11-20 20:26:08,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14740 to 10166. [2022-11-20 20:26:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10166 states, 10165 states have (on average 4.415150024594196) internal successors, (44880), 10165 states have internal predecessors, (44880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:08,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10166 states to 10166 states and 44880 transitions. [2022-11-20 20:26:08,344 INFO L78 Accepts]: Start accepts. Automaton has 10166 states and 44880 transitions. Word has length 58 [2022-11-20 20:26:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:08,344 INFO L495 AbstractCegarLoop]: Abstraction has 10166 states and 44880 transitions. [2022-11-20 20:26:08,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.142857142857143) internal successors, (145), 35 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10166 states and 44880 transitions. [2022-11-20 20:26:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:08,363 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:08,363 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:08,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:08,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-20 20:26:08,565 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:08,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:08,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1439943355, now seen corresponding path program 6 times [2022-11-20 20:26:08,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:08,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899544834] [2022-11-20 20:26:08,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:08,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:09,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:09,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899544834] [2022-11-20 20:26:09,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899544834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:09,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542865626] [2022-11-20 20:26:09,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:26:09,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:09,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:09,432 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:09,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 20:26:09,700 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:26:09,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:09,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 20:26:09,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:09,743 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:26:09,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:26:09,823 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:26:09,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:26:09,837 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:26:09,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:10,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:26:10,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:10,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:10,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:10,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:26:10,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:26:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:11,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542865626] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:11,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1904321951] [2022-11-20 20:26:11,100 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:11,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:11,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-11-20 20:26:11,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092924146] [2022-11-20 20:26:11,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:11,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 20:26:11,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:11,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 20:26:11,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=506, Unknown=5, NotChecked=0, Total=600 [2022-11-20 20:26:11,103 INFO L87 Difference]: Start difference. First operand 10166 states and 44880 transitions. Second operand has 25 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:13,562 INFO L93 Difference]: Finished difference Result 17030 states and 76486 transitions. [2022-11-20 20:26:13,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-20 20:26:13,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:13,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:13,616 INFO L225 Difference]: With dead ends: 17030 [2022-11-20 20:26:13,616 INFO L226 Difference]: Without dead ends: 16253 [2022-11-20 20:26:13,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=404, Invalid=1571, Unknown=5, NotChecked=0, Total=1980 [2022-11-20 20:26:13,617 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1002 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:13,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 472 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1587 Invalid, 0 Unknown, 175 Unchecked, 1.5s Time] [2022-11-20 20:26:13,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16253 states. [2022-11-20 20:26:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16253 to 10423. [2022-11-20 20:26:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10423 states, 10422 states have (on average 4.395317597390136) internal successors, (45808), 10422 states have internal predecessors, (45808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:13,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10423 states to 10423 states and 45808 transitions. [2022-11-20 20:26:13,987 INFO L78 Accepts]: Start accepts. Automaton has 10423 states and 45808 transitions. Word has length 58 [2022-11-20 20:26:13,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:13,988 INFO L495 AbstractCegarLoop]: Abstraction has 10423 states and 45808 transitions. [2022-11-20 20:26:13,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.708333333333333) internal successors, (113), 24 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:13,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10423 states and 45808 transitions. [2022-11-20 20:26:14,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:14,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:14,007 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:14,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:14,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:14,208 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:14,209 INFO L85 PathProgramCache]: Analyzing trace with hash 811271622, now seen corresponding path program 2 times [2022-11-20 20:26:14,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:14,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949663853] [2022-11-20 20:26:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:15,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949663853] [2022-11-20 20:26:15,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949663853] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579158701] [2022-11-20 20:26:15,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:26:15,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:15,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:15,073 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:15,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-11-20 20:26:15,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:26:15,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:15,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-20 20:26:15,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:15,555 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:26:15,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:26:15,701 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 20:26:15,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-20 20:26:15,741 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:26:15,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:16,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:26:16,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:16,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:16,384 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2198 (Array Int Int))) (= (+ c_~s_6~0 c_~t_9~0) (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2198) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) is different from false [2022-11-20 20:26:16,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:16,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:26:16,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:26:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:16,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579158701] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:16,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1087046299] [2022-11-20 20:26:16,938 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:16,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:16,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 27 [2022-11-20 20:26:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042148259] [2022-11-20 20:26:16,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:16,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-20 20:26:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-20 20:26:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=657, Unknown=1, NotChecked=52, Total=812 [2022-11-20 20:26:16,940 INFO L87 Difference]: Start difference. First operand 10423 states and 45808 transitions. Second operand has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:24,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:24,310 INFO L93 Difference]: Finished difference Result 41500 states and 188745 transitions. [2022-11-20 20:26:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-20 20:26:24,310 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:24,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:24,443 INFO L225 Difference]: With dead ends: 41500 [2022-11-20 20:26:24,443 INFO L226 Difference]: Without dead ends: 39731 [2022-11-20 20:26:24,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1197, Invalid=4500, Unknown=7, NotChecked=148, Total=5852 [2022-11-20 20:26:24,444 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 2498 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 2756 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2498 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 3787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 965 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:24,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2498 Valid, 801 Invalid, 3787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2756 Invalid, 0 Unknown, 965 Unchecked, 3.0s Time] [2022-11-20 20:26:24,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39731 states. [2022-11-20 20:26:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39731 to 10521. [2022-11-20 20:26:24,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10521 states, 10520 states have (on average 4.399524714828897) internal successors, (46283), 10520 states have internal predecessors, (46283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:24,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10521 states to 10521 states and 46283 transitions. [2022-11-20 20:26:24,899 INFO L78 Accepts]: Start accepts. Automaton has 10521 states and 46283 transitions. Word has length 58 [2022-11-20 20:26:24,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:24,899 INFO L495 AbstractCegarLoop]: Abstraction has 10521 states and 46283 transitions. [2022-11-20 20:26:24,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 10521 states and 46283 transitions. [2022-11-20 20:26:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:24,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:24,919 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:24,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:25,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-20 20:26:25,120 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1716713594, now seen corresponding path program 3 times [2022-11-20 20:26:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802736877] [2022-11-20 20:26:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:25,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:26,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:26,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802736877] [2022-11-20 20:26:26,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802736877] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:26,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1716799784] [2022-11-20 20:26:26,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:26:26,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:26,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:26,651 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:26,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-20 20:26:26,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:26:26,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:26,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 20:26:26,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:26,980 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:26:26,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:26:27,074 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:26:27,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:26:27,089 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:26:27,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:27,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:26:27,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:27,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:27,911 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int))) (= (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2277) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0) (+ c_~s_6~0 c_~t_9~0))) is different from false [2022-11-20 20:26:27,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:27,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:26:27,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:26:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:28,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1716799784] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:28,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [267694533] [2022-11-20 20:26:28,330 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:28,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:28,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 33 [2022-11-20 20:26:28,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308630663] [2022-11-20 20:26:28,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:28,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:26:28,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:26:28,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=973, Unknown=1, NotChecked=64, Total=1190 [2022-11-20 20:26:28,332 INFO L87 Difference]: Start difference. First operand 10521 states and 46283 transitions. Second operand has 35 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:33,591 INFO L93 Difference]: Finished difference Result 17748 states and 79427 transitions. [2022-11-20 20:26:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-20 20:26:33,593 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:33,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:33,644 INFO L225 Difference]: With dead ends: 17748 [2022-11-20 20:26:33,644 INFO L226 Difference]: Without dead ends: 16933 [2022-11-20 20:26:33,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=990, Invalid=3840, Unknown=4, NotChecked=136, Total=4970 [2022-11-20 20:26:33,645 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 1448 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 373 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:33,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 713 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2705 Invalid, 0 Unknown, 373 Unchecked, 2.6s Time] [2022-11-20 20:26:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16933 states. [2022-11-20 20:26:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16933 to 10706. [2022-11-20 20:26:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10706 states, 10705 states have (on average 4.407566557683325) internal successors, (47183), 10705 states have internal predecessors, (47183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10706 states to 10706 states and 47183 transitions. [2022-11-20 20:26:33,918 INFO L78 Accepts]: Start accepts. Automaton has 10706 states and 47183 transitions. Word has length 58 [2022-11-20 20:26:33,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:33,918 INFO L495 AbstractCegarLoop]: Abstraction has 10706 states and 47183 transitions. [2022-11-20 20:26:33,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:33,919 INFO L276 IsEmpty]: Start isEmpty. Operand 10706 states and 47183 transitions. [2022-11-20 20:26:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:33,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:33,938 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:33,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-11-20 20:26:34,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:34,139 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:34,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash 804154775, now seen corresponding path program 7 times [2022-11-20 20:26:34,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:34,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244084419] [2022-11-20 20:26:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:34,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:34,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:34,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244084419] [2022-11-20 20:26:34,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244084419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:34,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535838145] [2022-11-20 20:26:34,749 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:26:34,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:34,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:34,752 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:34,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-11-20 20:26:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:35,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:26:35,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:35,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:35,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:35,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:35,663 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 25 treesize of output 20 [2022-11-20 20:26:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535838145] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [513169984] [2022-11-20 20:26:35,819 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:35,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:35,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2022-11-20 20:26:35,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467367554] [2022-11-20 20:26:35,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:35,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 20:26:35,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:35,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 20:26:35,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:26:35,821 INFO L87 Difference]: Start difference. First operand 10706 states and 47183 transitions. Second operand has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:37,392 INFO L93 Difference]: Finished difference Result 16608 states and 74214 transitions. [2022-11-20 20:26:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:26:37,392 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:37,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:37,442 INFO L225 Difference]: With dead ends: 16608 [2022-11-20 20:26:37,442 INFO L226 Difference]: Without dead ends: 15725 [2022-11-20 20:26:37,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-11-20 20:26:37,442 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 457 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:37,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 394 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1434 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 20:26:37,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15725 states. [2022-11-20 20:26:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15725 to 10916. [2022-11-20 20:26:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10916 states, 10915 states have (on average 4.413834173156207) internal successors, (48177), 10915 states have internal predecessors, (48177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10916 states to 10916 states and 48177 transitions. [2022-11-20 20:26:37,804 INFO L78 Accepts]: Start accepts. Automaton has 10916 states and 48177 transitions. Word has length 58 [2022-11-20 20:26:37,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:37,804 INFO L495 AbstractCegarLoop]: Abstraction has 10916 states and 48177 transitions. [2022-11-20 20:26:37,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10916 states and 48177 transitions. [2022-11-20 20:26:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:37,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:37,824 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:37,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-11-20 20:26:38,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-20 20:26:38,025 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -212873585, now seen corresponding path program 10 times [2022-11-20 20:26:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:38,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205096883] [2022-11-20 20:26:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:38,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:38,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205096883] [2022-11-20 20:26:38,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205096883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:38,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978070800] [2022-11-20 20:26:38,768 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:26:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:38,770 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:38,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-11-20 20:26:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:39,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:26:39,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:39,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:39,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:39,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:39,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:39,725 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 26 treesize of output 21 [2022-11-20 20:26:39,741 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:26:39,741 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 25 treesize of output 12 [2022-11-20 20:26:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:39,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978070800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1297083942] [2022-11-20 20:26:39,905 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:39,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:39,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 16 [2022-11-20 20:26:39,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888124271] [2022-11-20 20:26:39,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 20:26:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:39,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 20:26:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2022-11-20 20:26:39,908 INFO L87 Difference]: Start difference. First operand 10916 states and 48177 transitions. Second operand has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:41,539 INFO L93 Difference]: Finished difference Result 17616 states and 78627 transitions. [2022-11-20 20:26:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:26:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:41,591 INFO L225 Difference]: With dead ends: 17616 [2022-11-20 20:26:41,591 INFO L226 Difference]: Without dead ends: 16691 [2022-11-20 20:26:41,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2022-11-20 20:26:41,592 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 443 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:41,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 385 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 20:26:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2022-11-20 20:26:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 11196. [2022-11-20 20:26:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11196 states, 11195 states have (on average 4.407235372934346) internal successors, (49339), 11195 states have internal predecessors, (49339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11196 states to 11196 states and 49339 transitions. [2022-11-20 20:26:41,988 INFO L78 Accepts]: Start accepts. Automaton has 11196 states and 49339 transitions. Word has length 58 [2022-11-20 20:26:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:41,988 INFO L495 AbstractCegarLoop]: Abstraction has 11196 states and 49339 transitions. [2022-11-20 20:26:41,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 11196 states and 49339 transitions. [2022-11-20 20:26:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:42,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:42,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:42,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:42,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:42,211 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:42,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:42,212 INFO L85 PathProgramCache]: Analyzing trace with hash -508164399, now seen corresponding path program 8 times [2022-11-20 20:26:42,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:42,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793820062] [2022-11-20 20:26:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:42,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:42,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793820062] [2022-11-20 20:26:42,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793820062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:42,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828607587] [2022-11-20 20:26:42,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:26:42,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:42,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:42,888 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:42,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-11-20 20:26:43,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:26:43,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:43,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-20 20:26:43,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:43,226 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:26:43,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:26:43,326 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:26:43,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:26:43,340 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:26:43,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:43,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:26:43,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:43,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 20:26:43,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:43,897 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2504 (Array Int Int))) (= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2504) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) c_~s_2~0)) is different from false [2022-11-20 20:26:43,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:43,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:26:43,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:26:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-11-20 20:26:44,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828607587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:44,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1250034530] [2022-11-20 20:26:44,290 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:44,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:44,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2022-11-20 20:26:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861671606] [2022-11-20 20:26:44,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:44,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 20:26:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 20:26:44,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=4, NotChecked=48, Total=702 [2022-11-20 20:26:44,293 INFO L87 Difference]: Start difference. First operand 11196 states and 49339 transitions. Second operand has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:47,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:47,433 INFO L93 Difference]: Finished difference Result 17388 states and 77772 transitions. [2022-11-20 20:26:47,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-20 20:26:47,434 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:47,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:47,484 INFO L225 Difference]: With dead ends: 17388 [2022-11-20 20:26:47,485 INFO L226 Difference]: Without dead ends: 16631 [2022-11-20 20:26:47,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=419, Invalid=1930, Unknown=7, NotChecked=94, Total=2450 [2022-11-20 20:26:47,485 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 1168 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 733 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:47,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 688 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2355 Invalid, 0 Unknown, 733 Unchecked, 2.1s Time] [2022-11-20 20:26:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16631 states. [2022-11-20 20:26:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16631 to 11346. [2022-11-20 20:26:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11346 states, 11345 states have (on average 4.409960334949317) internal successors, (50031), 11345 states have internal predecessors, (50031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11346 states to 11346 states and 50031 transitions. [2022-11-20 20:26:47,765 INFO L78 Accepts]: Start accepts. Automaton has 11346 states and 50031 transitions. Word has length 58 [2022-11-20 20:26:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:47,765 INFO L495 AbstractCegarLoop]: Abstraction has 11346 states and 50031 transitions. [2022-11-20 20:26:47,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:47,765 INFO L276 IsEmpty]: Start isEmpty. Operand 11346 states and 50031 transitions. [2022-11-20 20:26:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:47,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:47,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:47,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:47,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-20 20:26:47,987 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:47,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 92195881, now seen corresponding path program 11 times [2022-11-20 20:26:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:47,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161877850] [2022-11-20 20:26:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:48,775 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:48,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161877850] [2022-11-20 20:26:48,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161877850] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:48,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509924602] [2022-11-20 20:26:48,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:26:48,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:48,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:48,776 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:48,778 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-11-20 20:26:49,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:26:49,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:49,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-20 20:26:49,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:49,148 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:26:49,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:26:49,301 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:26:49,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:26:49,318 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:26:49,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:26:50,069 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 18 treesize of output 20 [2022-11-20 20:26:50,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-20 20:26:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:50,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:50,458 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_2583 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2583) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_2583 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_2583) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2022-11-20 20:26:50,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:50,641 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 115 treesize of output 80 [2022-11-20 20:26:50,658 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 65 treesize of output 58 [2022-11-20 20:26:50,664 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 58 treesize of output 51 [2022-11-20 20:26:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:26:51,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509924602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:51,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992080898] [2022-11-20 20:26:51,788 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:51,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:51,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2022-11-20 20:26:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937692474] [2022-11-20 20:26:51,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:51,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-20 20:26:51,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-20 20:26:51,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=996, Unknown=2, NotChecked=64, Total=1190 [2022-11-20 20:26:51,791 INFO L87 Difference]: Start difference. First operand 11346 states and 50031 transitions. Second operand has 35 states, 34 states have (on average 3.823529411764706) internal successors, (130), 34 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:55,090 INFO L93 Difference]: Finished difference Result 18024 states and 80207 transitions. [2022-11-20 20:26:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-20 20:26:55,091 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.823529411764706) internal successors, (130), 34 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:55,144 INFO L225 Difference]: With dead ends: 18024 [2022-11-20 20:26:55,144 INFO L226 Difference]: Without dead ends: 17231 [2022-11-20 20:26:55,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 95 SyntacticMatches, 6 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=448, Invalid=2860, Unknown=2, NotChecked=112, Total=3422 [2022-11-20 20:26:55,145 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1284 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 929 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:55,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 789 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1982 Invalid, 0 Unknown, 929 Unchecked, 1.9s Time] [2022-11-20 20:26:55,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17231 states. [2022-11-20 20:26:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17231 to 11466. [2022-11-20 20:26:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11466 states, 11465 states have (on average 4.416310510248582) internal successors, (50633), 11465 states have internal predecessors, (50633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11466 states to 11466 states and 50633 transitions. [2022-11-20 20:26:55,435 INFO L78 Accepts]: Start accepts. Automaton has 11466 states and 50633 transitions. Word has length 58 [2022-11-20 20:26:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:55,435 INFO L495 AbstractCegarLoop]: Abstraction has 11466 states and 50633 transitions. [2022-11-20 20:26:55,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.823529411764706) internal successors, (130), 34 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11466 states and 50633 transitions. [2022-11-20 20:26:55,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:55,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:55,458 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:55,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:55,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-20 20:26:55,659 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:55,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -970130901, now seen corresponding path program 9 times [2022-11-20 20:26:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123390747] [2022-11-20 20:26:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:56,216 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123390747] [2022-11-20 20:26:56,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123390747] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:56,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391953040] [2022-11-20 20:26:56,217 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:26:56,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:56,218 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:56,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-11-20 20:26:56,499 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:26:56,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:26:56,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:26:56,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:26:56,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:26:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:56,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:26:56,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:26:56,985 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 25 treesize of output 20 [2022-11-20 20:26:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:57,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391953040] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:26:57,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [50622431] [2022-11-20 20:26:57,114 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:26:57,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:26:57,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-11-20 20:26:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381250583] [2022-11-20 20:26:57,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:26:57,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:26:57,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:26:57,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:26:57,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:26:57,117 INFO L87 Difference]: Start difference. First operand 11466 states and 50633 transitions. Second operand has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:26:58,467 INFO L93 Difference]: Finished difference Result 16312 states and 73067 transitions. [2022-11-20 20:26:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:26:58,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:26:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:26:58,515 INFO L225 Difference]: With dead ends: 16312 [2022-11-20 20:26:58,515 INFO L226 Difference]: Without dead ends: 15575 [2022-11-20 20:26:58,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:26:58,516 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 427 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:26:58,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 388 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-20 20:26:58,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15575 states. [2022-11-20 20:26:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15575 to 11508. [2022-11-20 20:26:58,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11508 states, 11507 states have (on average 4.418180238115929) internal successors, (50840), 11507 states have internal predecessors, (50840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11508 states to 11508 states and 50840 transitions. [2022-11-20 20:26:58,789 INFO L78 Accepts]: Start accepts. Automaton has 11508 states and 50840 transitions. Word has length 58 [2022-11-20 20:26:58,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:26:58,790 INFO L495 AbstractCegarLoop]: Abstraction has 11508 states and 50840 transitions. [2022-11-20 20:26:58,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:26:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11508 states and 50840 transitions. [2022-11-20 20:26:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:26:58,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:26:58,812 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:26:58,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-11-20 20:26:59,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:59,013 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:26:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:26:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1752145521, now seen corresponding path program 10 times [2022-11-20 20:26:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:26:59,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977565203] [2022-11-20 20:26:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:26:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:26:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:26:59,653 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:26:59,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977565203] [2022-11-20 20:26:59,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977565203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:26:59,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536241113] [2022-11-20 20:26:59,653 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:26:59,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:26:59,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:26:59,654 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:26:59,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-11-20 20:26:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:26:59,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:26:59,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:00,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:00,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:00,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:00,470 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 25 treesize of output 20 [2022-11-20 20:27:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536241113] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1120152195] [2022-11-20 20:27:00,603 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:00,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:00,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-11-20 20:27:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128265216] [2022-11-20 20:27:00,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:00,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:27:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:27:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:27:00,605 INFO L87 Difference]: Start difference. First operand 11508 states and 50840 transitions. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:02,190 INFO L93 Difference]: Finished difference Result 16484 states and 73956 transitions. [2022-11-20 20:27:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:27:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:02,238 INFO L225 Difference]: With dead ends: 16484 [2022-11-20 20:27:02,238 INFO L226 Difference]: Without dead ends: 15581 [2022-11-20 20:27:02,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:27:02,238 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 361 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:02,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 457 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-20 20:27:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15581 states. [2022-11-20 20:27:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15581 to 11466. [2022-11-20 20:27:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11466 states, 11465 states have (on average 4.416310510248582) internal successors, (50633), 11465 states have internal predecessors, (50633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:02,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11466 states to 11466 states and 50633 transitions. [2022-11-20 20:27:02,508 INFO L78 Accepts]: Start accepts. Automaton has 11466 states and 50633 transitions. Word has length 58 [2022-11-20 20:27:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:02,508 INFO L495 AbstractCegarLoop]: Abstraction has 11466 states and 50633 transitions. [2022-11-20 20:27:02,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 11466 states and 50633 transitions. [2022-11-20 20:27:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:02,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:02,529 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:02,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:02,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-20 20:27:02,730 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:02,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash 918158627, now seen corresponding path program 12 times [2022-11-20 20:27:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:02,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290419883] [2022-11-20 20:27:02,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:03,211 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:03,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290419883] [2022-11-20 20:27:03,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290419883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657215636] [2022-11-20 20:27:03,212 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:27:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:03,213 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:03,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-11-20 20:27:03,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:27:03,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:27:03,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:27:03,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:03,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:03,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:04,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:04,084 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 26 treesize of output 21 [2022-11-20 20:27:04,099 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:27:04,099 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 25 treesize of output 12 [2022-11-20 20:27:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:04,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657215636] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:04,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [857090244] [2022-11-20 20:27:04,262 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:04,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 15 [2022-11-20 20:27:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172321337] [2022-11-20 20:27:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:04,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-20 20:27:04,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-20 20:27:04,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-20 20:27:04,265 INFO L87 Difference]: Start difference. First operand 11466 states and 50633 transitions. Second operand has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:05,505 INFO L93 Difference]: Finished difference Result 17456 states and 78231 transitions. [2022-11-20 20:27:05,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 20:27:05,506 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:05,557 INFO L225 Difference]: With dead ends: 17456 [2022-11-20 20:27:05,557 INFO L226 Difference]: Without dead ends: 16535 [2022-11-20 20:27:05,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 107 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:27:05,558 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 448 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:05,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 324 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-20 20:27:05,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16535 states. [2022-11-20 20:27:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16535 to 11634. [2022-11-20 20:27:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11634 states, 11633 states have (on average 4.422848792229003) internal successors, (51451), 11633 states have internal predecessors, (51451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:05,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11634 states to 11634 states and 51451 transitions. [2022-11-20 20:27:05,839 INFO L78 Accepts]: Start accepts. Automaton has 11634 states and 51451 transitions. Word has length 58 [2022-11-20 20:27:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:05,839 INFO L495 AbstractCegarLoop]: Abstraction has 11634 states and 51451 transitions. [2022-11-20 20:27:05,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.533333333333333) internal successors, (98), 16 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:05,839 INFO L276 IsEmpty]: Start isEmpty. Operand 11634 states and 51451 transitions. [2022-11-20 20:27:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:05,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:05,862 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:05,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:06,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-20 20:27:06,062 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:06,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:06,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2144165425, now seen corresponding path program 13 times [2022-11-20 20:27:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:06,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600356260] [2022-11-20 20:27:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:27:07,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:07,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600356260] [2022-11-20 20:27:07,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600356260] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:07,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601144319] [2022-11-20 20:27:07,155 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:27:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:07,156 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:07,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-20 20:27:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:07,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-20 20:27:07,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:07,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:07,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:08,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:08,191 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 26 treesize of output 21 [2022-11-20 20:27:08,217 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-11-20 20:27:08,217 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 25 treesize of output 12 [2022-11-20 20:27:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:08,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601144319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:08,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [735597184] [2022-11-20 20:27:08,421 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:08,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:08,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 7] total 26 [2022-11-20 20:27:08,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511245454] [2022-11-20 20:27:08,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:08,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-20 20:27:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:08,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-20 20:27:08,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2022-11-20 20:27:08,424 INFO L87 Difference]: Start difference. First operand 11634 states and 51451 transitions. Second operand has 27 states, 26 states have (on average 4.5) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:11,880 INFO L93 Difference]: Finished difference Result 19904 states and 89093 transitions. [2022-11-20 20:27:11,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 20:27:11,880 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.5) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:11,939 INFO L225 Difference]: With dead ends: 19904 [2022-11-20 20:27:11,939 INFO L226 Difference]: Without dead ends: 18971 [2022-11-20 20:27:11,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=373, Invalid=1697, Unknown=0, NotChecked=0, Total=2070 [2022-11-20 20:27:11,940 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 715 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 2763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:11,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 801 Invalid, 2763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-20 20:27:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18971 states. [2022-11-20 20:27:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18971 to 11506. [2022-11-20 20:27:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11506 states, 11505 states have (on average 4.417122990004346) internal successors, (50819), 11505 states have internal predecessors, (50819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11506 states to 11506 states and 50819 transitions. [2022-11-20 20:27:12,241 INFO L78 Accepts]: Start accepts. Automaton has 11506 states and 50819 transitions. Word has length 58 [2022-11-20 20:27:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:12,242 INFO L495 AbstractCegarLoop]: Abstraction has 11506 states and 50819 transitions. [2022-11-20 20:27:12,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.5) internal successors, (117), 27 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:12,242 INFO L276 IsEmpty]: Start isEmpty. Operand 11506 states and 50819 transitions. [2022-11-20 20:27:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:12,263 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:12,263 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:12,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:12,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-11-20 20:27:12,464 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:12,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:12,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1972226415, now seen corresponding path program 11 times [2022-11-20 20:27:12,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:12,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81698708] [2022-11-20 20:27:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:12,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:13,174 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81698708] [2022-11-20 20:27:13,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81698708] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513180104] [2022-11-20 20:27:13,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:27:13,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:13,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:13,176 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:13,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-11-20 20:27:13,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 20:27:13,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:27:13,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 20:27:13,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:13,631 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:27:13,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:27:13,732 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:27:13,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:27:13,747 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:27:13,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:27:14,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:27:14,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:14,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:14,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:14,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:27:14,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:27:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:14,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513180104] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:14,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1913823555] [2022-11-20 20:27:14,812 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:14,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:14,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-11-20 20:27:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324747672] [2022-11-20 20:27:14,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:14,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:27:14,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:14,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:27:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=556, Unknown=3, NotChecked=0, Total=650 [2022-11-20 20:27:14,813 INFO L87 Difference]: Start difference. First operand 11506 states and 50819 transitions. Second operand has 26 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:17,751 INFO L93 Difference]: Finished difference Result 17178 states and 77048 transitions. [2022-11-20 20:27:17,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-20 20:27:17,752 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:17,802 INFO L225 Difference]: With dead ends: 17178 [2022-11-20 20:27:17,802 INFO L226 Difference]: Without dead ends: 16421 [2022-11-20 20:27:17,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=1842, Unknown=3, NotChecked=0, Total=2256 [2022-11-20 20:27:17,803 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1148 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:17,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 569 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2127 Invalid, 0 Unknown, 142 Unchecked, 2.0s Time] [2022-11-20 20:27:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16421 states. [2022-11-20 20:27:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16421 to 11266. [2022-11-20 20:27:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11266 states, 11265 states have (on average 4.410297381269419) internal successors, (49682), 11265 states have internal predecessors, (49682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:18,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11266 states to 11266 states and 49682 transitions. [2022-11-20 20:27:18,074 INFO L78 Accepts]: Start accepts. Automaton has 11266 states and 49682 transitions. Word has length 58 [2022-11-20 20:27:18,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:18,074 INFO L495 AbstractCegarLoop]: Abstraction has 11266 states and 49682 transitions. [2022-11-20 20:27:18,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.32) internal successors, (108), 25 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:18,075 INFO L276 IsEmpty]: Start isEmpty. Operand 11266 states and 49682 transitions. [2022-11-20 20:27:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:18,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:18,094 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:18,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:18,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:18,295 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1591657765, now seen corresponding path program 12 times [2022-11-20 20:27:18,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:18,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600717551] [2022-11-20 20:27:18,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:18,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600717551] [2022-11-20 20:27:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600717551] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358693310] [2022-11-20 20:27:18,954 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 20:27:18,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:18,957 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:18,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-11-20 20:27:19,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 20:27:19,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:27:19,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-20 20:27:19,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:19,305 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-11-20 20:27:19,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 27 [2022-11-20 20:27:19,462 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 20:27:19,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 20:27:19,476 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-20 20:27:19,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-20 20:27:19,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:27:19,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:19,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:20,037 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3037 (Array Int Int))) (= (+ c_~t_4~0 c_~s_2~0) (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3037) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))))) is different from false [2022-11-20 20:27:20,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:20,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:27:20,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:27:20,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:20,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358693310] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:20,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [841007771] [2022-11-20 20:27:20,379 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:20,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:20,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2022-11-20 20:27:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95398928] [2022-11-20 20:27:20,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:20,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-20 20:27:20,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-20 20:27:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=473, Unknown=1, NotChecked=44, Total=600 [2022-11-20 20:27:20,381 INFO L87 Difference]: Start difference. First operand 11266 states and 49682 transitions. Second operand has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:22,763 INFO L93 Difference]: Finished difference Result 16737 states and 75245 transitions. [2022-11-20 20:27:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-20 20:27:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:22,813 INFO L225 Difference]: With dead ends: 16737 [2022-11-20 20:27:22,813 INFO L226 Difference]: Without dead ends: 16400 [2022-11-20 20:27:22,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=354, Invalid=1367, Unknown=5, NotChecked=80, Total=1806 [2022-11-20 20:27:22,814 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 884 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 333 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:22,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 482 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1657 Invalid, 0 Unknown, 333 Unchecked, 1.5s Time] [2022-11-20 20:27:22,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16400 states. [2022-11-20 20:27:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16400 to 11423. [2022-11-20 20:27:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11423 states, 11422 states have (on average 4.420241638942392) internal successors, (50488), 11422 states have internal predecessors, (50488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11423 states to 11423 states and 50488 transitions. [2022-11-20 20:27:23,100 INFO L78 Accepts]: Start accepts. Automaton has 11423 states and 50488 transitions. Word has length 58 [2022-11-20 20:27:23,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:23,101 INFO L495 AbstractCegarLoop]: Abstraction has 11423 states and 50488 transitions. [2022-11-20 20:27:23,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 24 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:23,101 INFO L276 IsEmpty]: Start isEmpty. Operand 11423 states and 50488 transitions. [2022-11-20 20:27:23,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:23,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:23,122 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:23,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-11-20 20:27:23,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-20 20:27:23,322 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:23,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -675475735, now seen corresponding path program 13 times [2022-11-20 20:27:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269763234] [2022-11-20 20:27:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:23,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:23,988 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269763234] [2022-11-20 20:27:23,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269763234] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:23,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526381069] [2022-11-20 20:27:23,989 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-20 20:27:23,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:23,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:23,990 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:23,993 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-11-20 20:27:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:24,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 20:27:24,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:24,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:24,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:27:24,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-20 20:27:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:24,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:25,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:25,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 43 [2022-11-20 20:27:25,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2022-11-20 20:27:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:25,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526381069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 20:27:25,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412172783] [2022-11-20 20:27:25,473 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-20 20:27:25,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 20:27:25,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-11-20 20:27:25,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317547077] [2022-11-20 20:27:25,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 20:27:25,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-20 20:27:25,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-20 20:27:25,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-20 20:27:25,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=545, Unknown=2, NotChecked=0, Total=650 [2022-11-20 20:27:25,475 INFO L87 Difference]: Start difference. First operand 11423 states and 50488 transitions. Second operand has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 20:27:27,593 INFO L93 Difference]: Finished difference Result 16696 states and 75158 transitions. [2022-11-20 20:27:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-20 20:27:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-11-20 20:27:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 20:27:27,641 INFO L225 Difference]: With dead ends: 16696 [2022-11-20 20:27:27,641 INFO L226 Difference]: Without dead ends: 15929 [2022-11-20 20:27:27,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 97 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=307, Invalid=1251, Unknown=2, NotChecked=0, Total=1560 [2022-11-20 20:27:27,642 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 577 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-20 20:27:27,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 496 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1696 Invalid, 0 Unknown, 114 Unchecked, 1.4s Time] [2022-11-20 20:27:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15929 states. [2022-11-20 20:27:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15929 to 11493. [2022-11-20 20:27:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11493 states, 11492 states have (on average 4.422293769578838) internal successors, (50821), 11492 states have internal predecessors, (50821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:27,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11493 states to 11493 states and 50821 transitions. [2022-11-20 20:27:27,914 INFO L78 Accepts]: Start accepts. Automaton has 11493 states and 50821 transitions. Word has length 58 [2022-11-20 20:27:27,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 20:27:27,915 INFO L495 AbstractCegarLoop]: Abstraction has 11493 states and 50821 transitions. [2022-11-20 20:27:27,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 25 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 20:27:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 11493 states and 50821 transitions. [2022-11-20 20:27:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-20 20:27:27,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 20:27:27,936 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 20:27:27,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-11-20 20:27:28,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-20 20:27:28,137 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2022-11-20 20:27:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 20:27:28,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1282698115, now seen corresponding path program 14 times [2022-11-20 20:27:28,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-20 20:27:28,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373135530] [2022-11-20 20:27:28,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 20:27:28,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 20:27:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 20:27:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-20 20:27:28,772 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-20 20:27:28,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373135530] [2022-11-20 20:27:28,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373135530] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 20:27:28,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566557013] [2022-11-20 20:27:28,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 20:27:28,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 20:27:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 [2022-11-20 20:27:28,773 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 20:27:28,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90bf2826-af28-4358-8bd1-8117127b2353/bin/utaipan-6cKwYrpEi9/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-11-20 20:27:29,114 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 20:27:29,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 20:27:29,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-20 20:27:29,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 20:27:29,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-20 20:27:29,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:27:29,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:27:29,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:27:29,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:27:30,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 20:27:30,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 20:27:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 20:27:30,311 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 19 treesize of output 7 [2022-11-20 20:27:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 20:27:30,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 20:27:30,712 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~t_4~0 c_~s_2~0)) (.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_3194 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse0)) .cse1)) (forall ((v_ArrVal_3194 (Array Int Int))) (< .cse1 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse0) 1))))) is different from false [2022-11-20 20:27:30,742 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (.cse0 (+ (select (select |c_#memory_int| c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) c_~s_2~0))) (and (forall ((v_ArrVal_3194 (Array Int Int))) (< .cse0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1) 1))) (forall ((v_ArrVal_3194 (Array Int Int))) (<= (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1)) .cse0)))) is different from false [2022-11-20 20:27:30,784 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_3193))) (< (+ (select (select .cse0 c_~X_0~0.base) .cse1) c_~s_2~0) (+ c_~s_6~0 (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2) 1)))) (forall ((v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_3193))) (<= (+ c_~s_6~0 (select (select (store .cse3 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2)) (+ (select (select .cse3 c_~X_0~0.base) .cse1) c_~s_2~0)))))) is different from false [2022-11-20 20:27:33,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (< (+ (select (select .cse0 c_~X_0~0.base) .cse1) c_~s_2~0) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (<= (select (select (store .cse3 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2) (+ (select (select .cse3 c_~X_0~0.base) .cse1) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))))) is different from false [2022-11-20 20:27:33,540 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) (.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (<= (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1) (+ (select (select .cse0 c_~X_0~0.base) .cse2) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))) (forall ((v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (< (+ (select (select .cse3 c_~X_0~0.base) .cse2) c_~s_2~0) (+ (select (select (store .cse3 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))))) is different from false [2022-11-20 20:27:33,624 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~X_0~0.offset 4)) (.cse1 (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))) (and (forall ((v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_3190) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (< (+ (select (select .cse0 c_~X_0~0.base) .cse1) c_~s_2~0) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))) (forall ((v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse3 (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_3190) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (<= (select (select (store .cse3 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse2) (+ (select (select .cse3 c_~X_0~0.base) .cse1) c_~s_2~0)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))))))) is different from false [2022-11-20 20:27:33,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~X_0~0.offset 4))) (and (forall ((v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse0 (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_3190) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (< (select (select .cse0 c_~X_0~0.base) .cse1) (+ (select (select (store .cse0 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1) 1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))) (forall ((v_ArrVal_3190 (Array Int Int)) (v_ArrVal_3191 (Array Int Int)) (|v_thread4Thread1of1ForFork0_~#t5~0.base_195| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_171| Int)) (or (forall ((v_ArrVal_3192 (Array Int Int)) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3194 (Array Int Int))) (let ((.cse2 (store (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t2~0.base| v_ArrVal_3190) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_3191) |v_thread4Thread1of1ForFork0_~#t5~0.base_195| v_ArrVal_3192) |v_thread4Thread1of1ForFork0_~#t6~0.base_171| v_ArrVal_3193))) (<= (select (select (store .cse2 |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_3194) c_~X_0~0.base) .cse1) (select (select .cse2 c_~X_0~0.base) .cse1)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t6~0.base_171|)))) (not (< |c_#StackHeapBarrier| |v_thread4Thread1of1ForFork0_~#t5~0.base_195|)))))) is different from false [2022-11-20 20:27:56,731 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 20:27:56,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 63 [2022-11-20 20:27:56,770 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 10881014 treesize of output 10736630