./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 16:09:33,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 16:09:33,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 16:09:33,356 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 16:09:33,357 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 16:09:33,358 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 16:09:33,359 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 16:09:33,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 16:09:33,362 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 16:09:33,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 16:09:33,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 16:09:33,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 16:09:33,366 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 16:09:33,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 16:09:33,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 16:09:33,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 16:09:33,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 16:09:33,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 16:09:33,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 16:09:33,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 16:09:33,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 16:09:33,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 16:09:33,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 16:09:33,379 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 16:09:33,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 16:09:33,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 16:09:33,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 16:09:33,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 16:09:33,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 16:09:33,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 16:09:33,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 16:09:33,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 16:09:33,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 16:09:33,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 16:09:33,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 16:09:33,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 16:09:33,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 16:09:33,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 16:09:33,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 16:09:33,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 16:09:33,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 16:09:33,394 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 16:09:33,414 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 16:09:33,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 16:09:33,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 16:09:33,415 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 16:09:33,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 16:09:33,416 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 16:09:33,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 16:09:33,417 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 16:09:33,417 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 16:09:33,417 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 16:09:33,417 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 16:09:33,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 16:09:33,418 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 16:09:33,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 16:09:33,418 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 16:09:33,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 16:09:33,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 16:09:33,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 16:09:33,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 16:09:33,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 16:09:33,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 16:09:33,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 16:09:33,421 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 16:09:33,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 16:09:33,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 16:09:33,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 16:09:33,422 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_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 238e609d3671ff2de494998b0abc6a14651375b5eb423e7b66fc3d987b466268 [2022-12-14 16:09:33,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 16:09:33,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 16:09:33,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 16:09:33,627 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 16:09:33,627 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 16:09:33,628 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-12-14 16:09:36,216 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 16:09:36,369 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 16:09:36,369 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c [2022-12-14 16:09:36,374 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/data/9c19083a9/6dfee3200b464e37b38581874574d3f0/FLAG5dd97c72d [2022-12-14 16:09:36,768 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/data/9c19083a9/6dfee3200b464e37b38581874574d3f0 [2022-12-14 16:09:36,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 16:09:36,772 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 16:09:36,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 16:09:36,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 16:09:36,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 16:09:36,778 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:36,780 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db9f713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36, skipping insertion in model container [2022-12-14 16:09:36,780 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:36,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 16:09:36,802 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 16:09:36,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,904 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,907 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,911 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,912 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,913 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,914 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,919 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_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-12-14 16:09:36,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:09:36,932 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 16:09:36,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,943 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,944 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-14 16:09:36,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-14 16:09:36,951 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_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/sv-benchmarks/c/weaver/popl20-send-receive.wvr.c[3107,3120] [2022-12-14 16:09:36,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 16:09:36,965 INFO L208 MainTranslator]: Completed translation [2022-12-14 16:09:36,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36 WrapperNode [2022-12-14 16:09:36,965 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 16:09:36,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 16:09:36,966 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 16:09:36,966 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 16:09:36,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:36,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:36,994 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 161 [2022-12-14 16:09:36,994 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 16:09:36,995 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 16:09:36,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 16:09:36,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 16:09:37,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 16:09:37,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 16:09:37,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 16:09:37,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 16:09:37,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (1/1) ... [2022-12-14 16:09:37,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 16:09:37,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:37,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 16:09:37,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 16:09:37,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-14 16:09:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-14 16:09:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-14 16:09:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-14 16:09:37,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 16:09:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-14 16:09:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-14 16:09:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 16:09:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 16:09:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 16:09:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 16:09:37,075 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-14 16:09:37,159 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 16:09:37,161 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 16:09:37,366 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 16:09:37,426 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 16:09:37,426 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-14 16:09:37,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:09:37 BoogieIcfgContainer [2022-12-14 16:09:37,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 16:09:37,429 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 16:09:37,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 16:09:37,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 16:09:37,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 04:09:36" (1/3) ... [2022-12-14 16:09:37,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569a1fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:09:37, skipping insertion in model container [2022-12-14 16:09:37,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 04:09:36" (2/3) ... [2022-12-14 16:09:37,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569a1fa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 04:09:37, skipping insertion in model container [2022-12-14 16:09:37,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 04:09:37" (3/3) ... [2022-12-14 16:09:37,434 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2022-12-14 16:09:37,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-14 16:09:37,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 16:09:37,449 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 16:09:37,449 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-14 16:09:37,506 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-14 16:09:37,530 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-14 16:09:37,540 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 142 transitions, 308 flow [2022-12-14 16:09:37,542 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 142 transitions, 308 flow [2022-12-14 16:09:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 142 transitions, 308 flow [2022-12-14 16:09:37,587 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2022-12-14 16:09:37,587 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-14 16:09:37,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 10/139 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 116. Up to 2 conditions per place. [2022-12-14 16:09:37,592 INFO L119 LiptonReduction]: Number of co-enabled transitions 1308 [2022-12-14 16:09:41,088 INFO L134 LiptonReduction]: Checked pairs total: 2059 [2022-12-14 16:09:41,089 INFO L136 LiptonReduction]: Total number of compositions: 129 [2022-12-14 16:09:41,095 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 28 transitions, 80 flow [2022-12-14 16:09:41,117 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,133 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 16:09:41,138 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;@1d08228d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 16:09:41,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 16:09:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 16:09:41,146 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:41,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:41,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:41,151 INFO L85 PathProgramCache]: Analyzing trace with hash -167685914, now seen corresponding path program 1 times [2022-12-14 16:09:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:41,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933697866] [2022-12-14 16:09:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:41,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:41,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933697866] [2022-12-14 16:09:41,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933697866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:41,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:09:41,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 16:09:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229301109] [2022-12-14 16:09:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:41,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:09:41,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:41,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:09:41,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:09:41,500 INFO L87 Difference]: Start difference. First operand has 129 states, 128 states have (on average 2.78125) internal successors, (356), 128 states have internal predecessors, (356), 0 states have call successors, (0), 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, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:41,596 INFO L93 Difference]: Finished difference Result 117 states and 312 transitions. [2022-12-14 16:09:41,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:09:41,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-12-14 16:09:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:41,604 INFO L225 Difference]: With dead ends: 117 [2022-12-14 16:09:41,604 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 16:09:41,605 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-12-14 16:09:41,607 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:41,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:09:41,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 16:09:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2022-12-14 16:09:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.7037037037037037) internal successors, (292), 108 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 292 transitions. [2022-12-14 16:09:41,637 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 292 transitions. Word has length 19 [2022-12-14 16:09:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:41,637 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 292 transitions. [2022-12-14 16:09:41,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 292 transitions. [2022-12-14 16:09:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 16:09:41,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:41,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:41,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 16:09:41,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:41,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1001832038, now seen corresponding path program 2 times [2022-12-14 16:09:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:41,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457539261] [2022-12-14 16:09:41,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:41,762 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:41,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457539261] [2022-12-14 16:09:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457539261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:41,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:09:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 16:09:41,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189643344] [2022-12-14 16:09:41,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:41,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:09:41,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:41,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:09:41,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:09:41,765 INFO L87 Difference]: Start difference. First operand 109 states and 292 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:41,832 INFO L93 Difference]: Finished difference Result 121 states and 311 transitions. [2022-12-14 16:09:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:09:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-12-14 16:09:41,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:41,834 INFO L225 Difference]: With dead ends: 121 [2022-12-14 16:09:41,834 INFO L226 Difference]: Without dead ends: 121 [2022-12-14 16:09:41,834 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-12-14 16:09:41,835 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:41,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:09:41,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-14 16:09:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2022-12-14 16:09:41,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.611111111111111) internal successors, (282), 108 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 282 transitions. [2022-12-14 16:09:41,843 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 282 transitions. Word has length 19 [2022-12-14 16:09:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 282 transitions. [2022-12-14 16:09:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 282 transitions. [2022-12-14 16:09:41,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 16:09:41,845 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:41,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:41,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 16:09:41,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:41,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:41,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1210873366, now seen corresponding path program 3 times [2022-12-14 16:09:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:41,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914880443] [2022-12-14 16:09:41,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:41,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:42,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:42,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914880443] [2022-12-14 16:09:42,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914880443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:42,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:09:42,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 16:09:42,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658196406] [2022-12-14 16:09:42,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:42,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 16:09:42,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:42,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 16:09:42,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 16:09:42,017 INFO L87 Difference]: Start difference. First operand 109 states and 282 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:42,129 INFO L93 Difference]: Finished difference Result 195 states and 496 transitions. [2022-12-14 16:09:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 16:09:42,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-12-14 16:09:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:42,131 INFO L225 Difference]: With dead ends: 195 [2022-12-14 16:09:42,131 INFO L226 Difference]: Without dead ends: 123 [2022-12-14 16:09:42,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 16:09:42,133 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:42,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:09:42,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-14 16:09:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2022-12-14 16:09:42,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 2.5714285714285716) internal successors, (288), 112 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 288 transitions. [2022-12-14 16:09:42,142 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 288 transitions. Word has length 19 [2022-12-14 16:09:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:42,143 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 288 transitions. [2022-12-14 16:09:42,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 288 transitions. [2022-12-14 16:09:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-14 16:09:42,143 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:42,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:42,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 16:09:42,144 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:42,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash -726535848, now seen corresponding path program 1 times [2022-12-14 16:09:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:42,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386834295] [2022-12-14 16:09:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:42,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:42,404 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:42,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386834295] [2022-12-14 16:09:42,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386834295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:42,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:09:42,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 16:09:42,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014083078] [2022-12-14 16:09:42,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:42,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:09:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:42,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:09:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:09:42,406 INFO L87 Difference]: Start difference. First operand 113 states and 288 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:42,494 INFO L93 Difference]: Finished difference Result 197 states and 483 transitions. [2022-12-14 16:09:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 16:09:42,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-12-14 16:09:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:42,496 INFO L225 Difference]: With dead ends: 197 [2022-12-14 16:09:42,496 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 16:09:42,496 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-12-14 16:09:42,497 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 37 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:42,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 9 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:09:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 16:09:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 99. [2022-12-14 16:09:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.4693877551020407) internal successors, (242), 98 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 242 transitions. [2022-12-14 16:09:42,503 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 242 transitions. Word has length 21 [2022-12-14 16:09:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:42,503 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 242 transitions. [2022-12-14 16:09:42,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 242 transitions. [2022-12-14 16:09:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-14 16:09:42,504 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:42,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:42,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 16:09:42,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:42,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash -466029574, now seen corresponding path program 1 times [2022-12-14 16:09:42,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:42,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891011481] [2022-12-14 16:09:42,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:09:42,581 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:42,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891011481] [2022-12-14 16:09:42,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891011481] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:42,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 16:09:42,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 16:09:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322841499] [2022-12-14 16:09:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:42,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:09:42,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:09:42,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 16:09:42,584 INFO L87 Difference]: Start difference. First operand 99 states and 242 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:42,633 INFO L93 Difference]: Finished difference Result 121 states and 279 transitions. [2022-12-14 16:09:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 16:09:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-14 16:09:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:42,635 INFO L225 Difference]: With dead ends: 121 [2022-12-14 16:09:42,635 INFO L226 Difference]: Without dead ends: 100 [2022-12-14 16:09:42,635 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-12-14 16:09:42,636 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:42,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 9 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 16:09:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-12-14 16:09:42,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-12-14 16:09:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.4545454545454546) internal successors, (243), 99 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 243 transitions. [2022-12-14 16:09:42,640 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 243 transitions. Word has length 23 [2022-12-14 16:09:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:42,640 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 243 transitions. [2022-12-14 16:09:42,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 243 transitions. [2022-12-14 16:09:42,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-14 16:09:42,641 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:42,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:42,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 16:09:42,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash 622189856, now seen corresponding path program 1 times [2022-12-14 16:09:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:42,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554426194] [2022-12-14 16:09:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:43,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:43,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554426194] [2022-12-14 16:09:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554426194] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948739643] [2022-12-14 16:09:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:43,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:43,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 16:09:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:43,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 16:09:43,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:43,578 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 11 treesize of output 7 [2022-12-14 16:09:43,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:09:43,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:09:43,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:09:43,868 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-12-14 16:09:43,930 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-12-14 16:09:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:43,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:09:44,124 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse0)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:09:44,378 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse0)))))) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))) 1)) (not (<= 0 c_~back~0))) is different from false [2022-12-14 16:09:44,424 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)) 1))))) (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)))) (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1))))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) is different from false [2022-12-14 16:09:44,625 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:44,625 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 65 treesize of output 53 [2022-12-14 16:09:44,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:44,638 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 402 treesize of output 390 [2022-12-14 16:09:44,653 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:44,653 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 378 treesize of output 354 [2022-12-14 16:09:44,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:44,671 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 203 treesize of output 197 [2022-12-14 16:09:44,681 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 278 treesize of output 230 [2022-12-14 16:09:45,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:45,151 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 65 treesize of output 53 [2022-12-14 16:09:45,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 16:09:45,165 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 16:09:45,165 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 316 treesize of output 288 [2022-12-14 16:09:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:09:45,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 188 [2022-12-14 16:09:45,194 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-14 16:09:45,194 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 260 treesize of output 216 [2022-12-14 16:09:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:45,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948739643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:09:45,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [456396267] [2022-12-14 16:09:45,361 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:09:45,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:09:45,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 31 [2022-12-14 16:09:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511692165] [2022-12-14 16:09:45,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:09:45,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 16:09:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 16:09:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=677, Unknown=6, NotChecked=168, Total=992 [2022-12-14 16:09:45,366 INFO L87 Difference]: Start difference. First operand 100 states and 243 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:46,386 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (or (let ((.cse2 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (not (= (select (select .cse0 c_~queue~0.base) .cse1) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)) 1))))) (forall ((v_ArrVal_148 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_148))) (or (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse2)))) (not (= (select (select .cse3 c_~queue~0.base) .cse1) 1))))))) (= (mod c_~v_assert~0 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) is different from false [2022-12-14 16:09:48,373 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (let ((.cse0 (let ((.cse7 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_149 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse7)) 1)) (forall ((v_ArrVal_149 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) c_~queue~0.base) .cse7))))))) (.cse1 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (.cse5 (not (< c_~back~0 c_~n~0))) (.cse4 (not (= .cse3 1))) (.cse6 (not (<= 0 c_~back~0)))) (and (or .cse0 .cse1) (or (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 .cse4))) .cse0 .cse1 .cse5 .cse6) (or .cse0 .cse1 .cse5 .cse4 .cse6)))) is different from false [2022-12-14 16:09:49,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:49,513 INFO L93 Difference]: Finished difference Result 561 states and 1478 transitions. [2022-12-14 16:09:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-12-14 16:09:49,514 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-14 16:09:49,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:49,516 INFO L225 Difference]: With dead ends: 561 [2022-12-14 16:09:49,516 INFO L226 Difference]: Without dead ends: 433 [2022-12-14 16:09:49,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=757, Invalid=4205, Unknown=28, NotChecked=710, Total=5700 [2022-12-14 16:09:49,518 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 484 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 54 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:49,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 21 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 847 Invalid, 27 Unknown, 414 Unchecked, 0.9s Time] [2022-12-14 16:09:49,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-12-14 16:09:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 163. [2022-12-14 16:09:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 2.388888888888889) internal successors, (387), 162 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 387 transitions. [2022-12-14 16:09:49,526 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 387 transitions. Word has length 24 [2022-12-14 16:09:49,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:49,526 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 387 transitions. [2022-12-14 16:09:49,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:49,526 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 387 transitions. [2022-12-14 16:09:49,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 16:09:49,527 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:49,527 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] [2022-12-14 16:09:49,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 16:09:49,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-14 16:09:49,729 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:49,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:49,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1310527282, now seen corresponding path program 2 times [2022-12-14 16:09:49,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:49,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760690350] [2022-12-14 16:09:49,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:49,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:50,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:50,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760690350] [2022-12-14 16:09:50,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760690350] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:50,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525950217] [2022-12-14 16:09:50,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:09:50,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:50,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:50,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:50,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 16:09:50,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 16:09:50,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:09:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 16:09:50,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:50,828 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 23 treesize of output 7 [2022-12-14 16:09:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 16:09:50,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:09:50,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:50,991 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 68 treesize of output 48 [2022-12-14 16:09:51,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 16:09:51,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525950217] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:09:51,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1348147386] [2022-12-14 16:09:51,182 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:09:51,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:09:51,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 23 [2022-12-14 16:09:51,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111845782] [2022-12-14 16:09:51,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:09:51,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-14 16:09:51,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:51,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-14 16:09:51,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-12-14 16:09:51,185 INFO L87 Difference]: Start difference. First operand 163 states and 387 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:52,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:52,244 INFO L93 Difference]: Finished difference Result 327 states and 797 transitions. [2022-12-14 16:09:52,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 16:09:52,244 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 16:09:52,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:52,246 INFO L225 Difference]: With dead ends: 327 [2022-12-14 16:09:52,246 INFO L226 Difference]: Without dead ends: 287 [2022-12-14 16:09:52,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=432, Invalid=1730, Unknown=0, NotChecked=0, Total=2162 [2022-12-14 16:09:52,247 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 256 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:52,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 8 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 16:09:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-12-14 16:09:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 167. [2022-12-14 16:09:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 166 states have (on average 2.4216867469879517) internal successors, (402), 166 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 402 transitions. [2022-12-14 16:09:52,255 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 402 transitions. Word has length 25 [2022-12-14 16:09:52,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:52,255 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 402 transitions. [2022-12-14 16:09:52,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:52,256 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 402 transitions. [2022-12-14 16:09:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-14 16:09:52,257 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:52,257 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] [2022-12-14 16:09:52,262 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 16:09:52,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-14 16:09:52,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1032181882, now seen corresponding path program 3 times [2022-12-14 16:09:52,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:52,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816024270] [2022-12-14 16:09:52,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:52,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:53,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:53,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816024270] [2022-12-14 16:09:53,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816024270] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:53,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189451489] [2022-12-14 16:09:53,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:09:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:53,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:53,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 16:09:53,446 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:09:53,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:09:53,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-14 16:09:53,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:53,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:09:53,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 18 treesize of output 20 [2022-12-14 16:09:53,637 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 23 treesize of output 7 [2022-12-14 16:09:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:09:53,687 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:09:53,793 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_246 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_246 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_246) c_~queue~0.base) .cse0)) 1)))) is different from false [2022-12-14 16:09:53,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:53,822 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 110 treesize of output 90 [2022-12-14 16:09:53,828 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 53 treesize of output 47 [2022-12-14 16:09:53,833 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 47 treesize of output 41 [2022-12-14 16:09:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 16:09:54,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189451489] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:09:54,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1151931653] [2022-12-14 16:09:54,062 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:09:54,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:09:54,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2022-12-14 16:09:54,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177415284] [2022-12-14 16:09:54,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:09:54,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 16:09:54,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:54,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 16:09:54,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=516, Unknown=1, NotChecked=46, Total=650 [2022-12-14 16:09:54,064 INFO L87 Difference]: Start difference. First operand 167 states and 402 transitions. Second operand has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:56,007 INFO L93 Difference]: Finished difference Result 283 states and 696 transitions. [2022-12-14 16:09:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-14 16:09:56,007 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-14 16:09:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:56,008 INFO L225 Difference]: With dead ends: 283 [2022-12-14 16:09:56,008 INFO L226 Difference]: Without dead ends: 253 [2022-12-14 16:09:56,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=445, Invalid=1910, Unknown=1, NotChecked=94, Total=2450 [2022-12-14 16:09:56,009 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 322 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:56,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 13 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 763 Invalid, 0 Unknown, 69 Unchecked, 0.5s Time] [2022-12-14 16:09:56,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-12-14 16:09:56,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 116. [2022-12-14 16:09:56,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 115 states have (on average 2.4956521739130433) internal successors, (287), 115 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 287 transitions. [2022-12-14 16:09:56,013 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 287 transitions. Word has length 25 [2022-12-14 16:09:56,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:56,013 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 287 transitions. [2022-12-14 16:09:56,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 25 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,014 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 287 transitions. [2022-12-14 16:09:56,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-14 16:09:56,014 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:56,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:56,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-14 16:09:56,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-14 16:09:56,216 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:56,217 INFO L85 PathProgramCache]: Analyzing trace with hash -309657374, now seen corresponding path program 4 times [2022-12-14 16:09:56,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:56,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994682557] [2022-12-14 16:09:56,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:56,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:56,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994682557] [2022-12-14 16:09:56,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994682557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:56,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230497837] [2022-12-14 16:09:56,363 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:09:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:56,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:56,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:56,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 16:09:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:56,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 16:09:56,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:56,492 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 124 treesize of output 92 [2022-12-14 16:09:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:09:56,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 16:09:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230497837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 16:09:56,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 16:09:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-12-14 16:09:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953754467] [2022-12-14 16:09:56,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 16:09:56,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 16:09:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 16:09:56,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 16:09:56,515 INFO L87 Difference]: Start difference. First operand 116 states and 287 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:56,563 INFO L93 Difference]: Finished difference Result 284 states and 691 transitions. [2022-12-14 16:09:56,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 16:09:56,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-12-14 16:09:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:56,565 INFO L225 Difference]: With dead ends: 284 [2022-12-14 16:09:56,565 INFO L226 Difference]: Without dead ends: 282 [2022-12-14 16:09:56,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-14 16:09:56,565 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:56,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 10 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 16:09:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-12-14 16:09:56,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 240. [2022-12-14 16:09:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 239 states have (on average 2.598326359832636) internal successors, (621), 239 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 621 transitions. [2022-12-14 16:09:56,571 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 621 transitions. Word has length 26 [2022-12-14 16:09:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:56,572 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 621 transitions. [2022-12-14 16:09:56,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 621 transitions. [2022-12-14 16:09:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 16:09:56,572 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:56,572 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:56,578 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 16:09:56,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:56,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash -606222114, now seen corresponding path program 5 times [2022-12-14 16:09:56,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:56,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989038746] [2022-12-14 16:09:56,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:56,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:56,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 16:09:56,874 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:56,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989038746] [2022-12-14 16:09:56,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989038746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:56,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503290302] [2022-12-14 16:09:56,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:09:56,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:56,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:56,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:56,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 16:09:57,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 16:09:57,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:09:57,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 16:09:57,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:57,080 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 124 treesize of output 92 [2022-12-14 16:09:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 16:09:57,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:09:57,175 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 136 treesize of output 104 [2022-12-14 16:09:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 16:09:57,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503290302] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:09:57,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1091363696] [2022-12-14 16:09:57,206 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:09:57,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:09:57,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-12-14 16:09:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423631566] [2022-12-14 16:09:57,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:09:57,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-14 16:09:57,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:09:57,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-14 16:09:57,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-12-14 16:09:57,208 INFO L87 Difference]: Start difference. First operand 240 states and 621 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:57,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:09:57,281 INFO L93 Difference]: Finished difference Result 294 states and 730 transitions. [2022-12-14 16:09:57,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 16:09:57,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-14 16:09:57,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:09:57,282 INFO L225 Difference]: With dead ends: 294 [2022-12-14 16:09:57,282 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 16:09:57,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-12-14 16:09:57,282 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 41 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:09:57,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 23 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:09:57,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 16:09:57,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-12-14 16:09:57,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.591666666666667) internal successors, (622), 240 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 622 transitions. [2022-12-14 16:09:57,288 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 622 transitions. Word has length 28 [2022-12-14 16:09:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:09:57,288 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 622 transitions. [2022-12-14 16:09:57,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:09:57,288 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 622 transitions. [2022-12-14 16:09:57,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 16:09:57,289 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:09:57,289 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:09:57,294 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 16:09:57,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 16:09:57,491 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:09:57,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:09:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1635604616, now seen corresponding path program 6 times [2022-12-14 16:09:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:09:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693011938] [2022-12-14 16:09:57,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:09:57,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:09:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:09:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:58,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:09:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693011938] [2022-12-14 16:09:58,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693011938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:09:58,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93067421] [2022-12-14 16:09:58,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:09:58,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:09:58,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:09:58,403 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:09:58,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 16:09:58,476 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:09:58,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:09:58,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 16:09:58,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:09:58,555 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-12-14 16:09:58,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:09:58,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:09:58,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:09:58,875 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 32 treesize of output 32 [2022-12-14 16:09:59,015 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:09:59,015 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 46 treesize of output 14 [2022-12-14 16:09:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:09:59,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:09:59,732 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4)) (.cse7 (+ c_~front~0 1))) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= (+ c_~back~0 1) c_~front~0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (< .cse7 0) (not (< c_~back~0 c_~n~0)) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse7))) is different from false [2022-12-14 16:09:59,794 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4)) (.cse7 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6 4)) (.cse4 (+ c_~queue~0.offset .cse6))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))) 1))))) (< .cse7 0) (not (< c_~back~0 c_~n~0)) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse7))) is different from false [2022-12-14 16:10:00,003 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse1 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (not (= (+ (select .cse0 .cse6) 1) 0)))))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse1) 1)) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4))) 1)) (not (= (+ (select .cse7 .cse6) 1) 0))))))))) (< .cse12 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse12))) is different from false [2022-12-14 16:10:00,033 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:00,033 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 129 treesize of output 93 [2022-12-14 16:10:00,068 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:10:00,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4098 treesize of output 3830 [2022-12-14 16:10:00,114 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:10:00,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3792 treesize of output 3596 [2022-12-14 16:10:00,164 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:10:00,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3558 treesize of output 3128 [2022-12-14 16:10:00,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:00,206 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 2870 treesize of output 2038 [2022-12-14 16:10:02,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:02,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 93 [2022-12-14 16:10:02,344 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 16:10:02,361 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:10:02,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2022-12-14 16:10:02,384 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:10:02,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 398 [2022-12-14 16:10:02,406 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:10:02,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 390 treesize of output 346 [2022-12-14 16:10:02,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-14 16:10:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93067421] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:10:02,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1716746631] [2022-12-14 16:10:02,659 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:10:02,660 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:10:02,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2022-12-14 16:10:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607968603] [2022-12-14 16:10:02,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:10:02,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-14 16:10:02,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:10:02,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-14 16:10:02,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1076, Unknown=10, NotChecked=216, Total=1560 [2022-12-14 16:10:02,662 INFO L87 Difference]: Start difference. First operand 241 states and 622 transitions. Second operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:04,847 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse12 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse11 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse1 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))))) (not (= (+ (select .cse0 .cse6) 1) 0)))))) (forall ((v_ArrVal_386 (Array Int Int)) (v_ArrVal_385 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_385) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_386))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse1) 1)) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ c_~sum~0 (select .cse8 .cse3) (select .cse8 .cse4))) 1)) (not (= (+ (select .cse7 .cse6) 1) 0))))))))) (< .cse12 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse12))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-12-14 16:10:15,299 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:10:15,324 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse8 (+ c_~front~0 1))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0))) (or .cse1 .cse0 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse7 (* c_~front~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse7 4)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse4) (select .cse6 .cse5))) 1))))) (< .cse8 0) (<= c_~n~0 .cse8))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-12-14 16:10:29,145 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_387 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_387 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (< .cse0 0) (<= c_~n~0 .cse0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-14 16:10:29,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:10:29,564 INFO L93 Difference]: Finished difference Result 1852 states and 4776 transitions. [2022-12-14 16:10:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-12-14 16:10:29,568 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2022-12-14 16:10:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:10:29,574 INFO L225 Difference]: With dead ends: 1852 [2022-12-14 16:10:29,575 INFO L226 Difference]: Without dead ends: 1624 [2022-12-14 16:10:29,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 148 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 7877 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=3116, Invalid=17064, Unknown=154, NotChecked=2016, Total=22350 [2022-12-14 16:10:29,580 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1122 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 158 mSolverCounterUnsat, 139 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 139 IncrementalHoareTripleChecker+Unknown, 609 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-12-14 16:10:29,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 26 Invalid, 3441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2535 Invalid, 139 Unknown, 609 Unchecked, 3.5s Time] [2022-12-14 16:10:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-12-14 16:10:29,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 507. [2022-12-14 16:10:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 506 states have (on average 2.590909090909091) internal successors, (1311), 506 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1311 transitions. [2022-12-14 16:10:29,607 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1311 transitions. Word has length 29 [2022-12-14 16:10:29,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:10:29,607 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 1311 transitions. [2022-12-14 16:10:29,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:29,607 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1311 transitions. [2022-12-14 16:10:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 16:10:29,608 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:10:29,608 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:10:29,614 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 16:10:29,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:10:29,810 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:10:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:10:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 32854708, now seen corresponding path program 7 times [2022-12-14 16:10:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:10:29,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729974964] [2022-12-14 16:10:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:10:29,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:10:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:10:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:10:31,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:10:31,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729974964] [2022-12-14 16:10:31,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729974964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:10:31,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711617966] [2022-12-14 16:10:31,029 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:10:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:10:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:10:31,030 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:10:31,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 16:10:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:10:31,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 16:10:31,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:10:31,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:10:31,538 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 44 treesize of output 42 [2022-12-14 16:10:31,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:31,606 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 42 treesize of output 14 [2022-12-14 16:10:31,658 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:10:31,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:10:31,784 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:10:31,800 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse2 4)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:10:32,060 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:10:32,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2022-12-14 16:10:32,074 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 59 treesize of output 52 [2022-12-14 16:10:32,085 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 52 treesize of output 45 [2022-12-14 16:10:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-14 16:10:33,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711617966] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:10:33,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [48777921] [2022-12-14 16:10:33,201 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:10:33,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:10:33,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 37 [2022-12-14 16:10:33,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879055373] [2022-12-14 16:10:33,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:10:33,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-14 16:10:33,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:10:33,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-14 16:10:33,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1079, Unknown=2, NotChecked=138, Total=1406 [2022-12-14 16:10:33,203 INFO L87 Difference]: Start difference. First operand 507 states and 1311 transitions. Second operand has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:34,634 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-12-14 16:10:35,061 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0) .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2022-12-14 16:10:35,643 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6))))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or .cse0 (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) .cse4 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or .cse0 .cse4)))) is different from false [2022-12-14 16:10:36,995 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:10:37,956 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6))))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or .cse0 (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) .cse4 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or .cse0 .cse4) (<= 1 c_~v_assert~0)))) is different from false [2022-12-14 16:10:39,490 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (<= c_~sum~0 0) (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)) 1)) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:10:41,081 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse0 (let ((.cse7 (* c_~front~0 4))) (let ((.cse5 (+ c_~queue~0.offset .cse7 4)) (.cse6 (select .cse3 (+ c_~queue~0.offset .cse7)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse5) .cse6))))))) (.cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) (and (or .cse0 (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse1) (not (= (+ .cse2 1) 0))) (or .cse1 (not (= .cse2 1))))) .cse4 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse0 .cse4) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)))) is different from false [2022-12-14 16:10:41,537 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256)) (.cse4 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse1 (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (+ c_~queue~0.offset .cse8 4)) (.cse7 (select .cse4 (+ c_~queue~0.offset .cse8)))) (and (forall ((v_ArrVal_436 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse6) .cse7) 1)) (forall ((v_ArrVal_436 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base) .cse6) .cse7))))))) (.cse5 (= .cse0 0))) (and (not (<= .cse0 0)) (or .cse1 (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1))))) .cse5 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))) (or .cse1 .cse5)))) is different from false [2022-12-14 16:10:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:10:42,110 INFO L93 Difference]: Finished difference Result 1998 states and 5266 transitions. [2022-12-14 16:10:42,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-12-14 16:10:42,111 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 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 29 [2022-12-14 16:10:42,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:10:42,115 INFO L225 Difference]: With dead ends: 1998 [2022-12-14 16:10:42,115 INFO L226 Difference]: Without dead ends: 1838 [2022-12-14 16:10:42,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 33 SyntacticMatches, 8 SemanticMatches, 108 ConstructedPredicates, 10 IntricatePredicates, 2 DeprecatedPredicates, 3581 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1560, Invalid=8330, Unknown=50, NotChecked=2050, Total=11990 [2022-12-14 16:10:42,117 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 470 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 92 mSolverCounterUnsat, 78 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 78 IncrementalHoareTripleChecker+Unknown, 867 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-14 16:10:42,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 19 Invalid, 3673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2636 Invalid, 78 Unknown, 867 Unchecked, 2.8s Time] [2022-12-14 16:10:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-12-14 16:10:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 686. [2022-12-14 16:10:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 2.640875912408759) internal successors, (1809), 685 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1809 transitions. [2022-12-14 16:10:42,137 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1809 transitions. Word has length 29 [2022-12-14 16:10:42,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:10:42,137 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 1809 transitions. [2022-12-14 16:10:42,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.8421052631578947) internal successors, (70), 37 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:10:42,137 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1809 transitions. [2022-12-14 16:10:42,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 16:10:42,139 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:10:42,139 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:10:42,145 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 16:10:42,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 16:10:42,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:10:42,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:10:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 534989516, now seen corresponding path program 8 times [2022-12-14 16:10:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:10:42,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640937440] [2022-12-14 16:10:42,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:10:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:10:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:10:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:10:43,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:10:43,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640937440] [2022-12-14 16:10:43,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640937440] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:10:43,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47816952] [2022-12-14 16:10:43,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:10:43,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:10:43,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:10:43,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:10:43,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 16:10:43,414 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 16:10:43,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:10:43,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-14 16:10:43,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:10:43,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:10:43,694 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-12-14 16:10:43,911 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:43,911 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 42 treesize of output 14 [2022-12-14 16:10:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:10:43,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:10:44,653 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:10:44,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 504 treesize of output 424 [2022-12-14 16:10:44,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:44,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 275 [2022-12-14 16:10:44,702 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:44,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 256 [2022-12-14 16:10:44,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:44,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 237 [2022-12-14 16:10:44,757 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:10:44,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 218 [2022-12-14 16:10:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:10:46,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47816952] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:10:46,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [336465051] [2022-12-14 16:10:46,858 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:10:46,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:10:46,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 36 [2022-12-14 16:10:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945401175] [2022-12-14 16:10:46,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:10:46,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 16:10:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:10:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 16:10:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1108, Unknown=11, NotChecked=0, Total=1332 [2022-12-14 16:10:46,860 INFO L87 Difference]: Start difference. First operand 686 states and 1809 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:11:07,410 WARN L233 SmtUtils]: Spent 18.90s on a formula simplification. DAG size of input: 113 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:11:28,749 WARN L233 SmtUtils]: Spent 20.79s on a formula simplification. DAG size of input: 116 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:11:47,785 WARN L233 SmtUtils]: Spent 18.87s on a formula simplification. DAG size of input: 116 DAG size of output: 107 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:11:50,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:11:52,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:12:16,082 WARN L233 SmtUtils]: Spent 23.02s on a formula simplification. DAG size of input: 111 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:12:42,208 WARN L233 SmtUtils]: Spent 23.06s on a formula simplification. DAG size of input: 115 DAG size of output: 108 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:12:45,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 16:13:23,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:13:23,264 INFO L93 Difference]: Finished difference Result 3076 states and 8055 transitions. [2022-12-14 16:13:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2022-12-14 16:13:23,265 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 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 29 [2022-12-14 16:13:23,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:13:23,271 INFO L225 Difference]: With dead ends: 3076 [2022-12-14 16:13:23,271 INFO L226 Difference]: Without dead ends: 2706 [2022-12-14 16:13:23,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13773 ImplicationChecksByTransitivity, 148.4s TimeCoverageRelationStatistics Valid=4587, Invalid=28696, Unknown=23, NotChecked=0, Total=33306 [2022-12-14 16:13:23,275 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 1048 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 125 mSolverCounterUnsat, 56 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 56 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-12-14 16:13:23,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 0 Invalid, 2099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1918 Invalid, 56 Unknown, 0 Unchecked, 9.0s Time] [2022-12-14 16:13:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2706 states. [2022-12-14 16:13:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2706 to 1090. [2022-12-14 16:13:23,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 1089 states have (on average 2.6978879706152434) internal successors, (2938), 1089 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:23,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 2938 transitions. [2022-12-14 16:13:23,304 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 2938 transitions. Word has length 29 [2022-12-14 16:13:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:13:23,304 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 2938 transitions. [2022-12-14 16:13:23,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 2938 transitions. [2022-12-14 16:13:23,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 16:13:23,306 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:13:23,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:13:23,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 16:13:23,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 16:13:23,508 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:13:23,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:13:23,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2044476552, now seen corresponding path program 9 times [2022-12-14 16:13:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:13:23,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559738962] [2022-12-14 16:13:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:13:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:13:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:13:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:13:24,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:13:24,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559738962] [2022-12-14 16:13:24,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559738962] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:13:24,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500730710] [2022-12-14 16:13:24,494 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:13:24,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:13:24,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:13:24,495 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:13:24,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 16:13:24,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:13:24,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:13:24,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-14 16:13:24,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:13:24,712 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-12-14 16:13:24,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:13:24,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-14 16:13:25,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:13:25,221 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 44 treesize of output 42 [2022-12-14 16:13:25,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:25,330 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 46 treesize of output 14 [2022-12-14 16:13:25,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:13:25,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:13:25,540 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)))))) (< c_~front~0 0)) is different from false [2022-12-14 16:13:25,612 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)))))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2022-12-14 16:13:25,676 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~front~0 1))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0))) (or .cse1 .cse0 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)) 1))))) (< .cse7 0) (<= c_~n~0 .cse7))) is different from false [2022-12-14 16:13:25,998 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4)) (.cse5 (+ c_~front~0 1))) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (<= (+ c_~back~0 1) c_~front~0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (let ((.cse4 (* c_~front~0 4))) (let ((.cse2 (select .cse0 (+ c_~queue~0.offset .cse4))) (.cse3 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse3)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse3)) 1))))) (< .cse5 0) (not (< c_~back~0 c_~n~0)) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse5))) is different from false [2022-12-14 16:13:26,069 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse1 (* c_~back~0 4)) (.cse5 (+ c_~front~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (not (= (+ (select .cse0 (+ c_~queue~0.offset .cse1 4)) 1) 0)) (let ((.cse4 (* c_~front~0 4))) (let ((.cse2 (select .cse0 (+ c_~queue~0.offset .cse4))) (.cse3 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse3)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse3)) 1))))) (< .cse5 0) (not (< c_~back~0 c_~n~0)) (not (= (select .cse0 (+ c_~queue~0.offset .cse1)) 1)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse5))) is different from false [2022-12-14 16:13:26,111 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~front~0 1))) (or (let ((.cse8 (* c_~front~0 4)) (.cse9 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse9 4)) (.cse2 (+ c_~queue~0.offset .cse9)) (.cse4 (+ c_~queue~0.offset .cse8 4)) (.cse5 (+ c_~queue~0.offset .cse8))) (and (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse0 (select .cse3 c_~queue~0.base))) (or (not (= (+ (select .cse0 .cse1) 1) 0)) (not (= (select .cse0 .cse2) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse4) (select .cse0 .cse5)))))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_537))) (let ((.cse6 (select .cse7 c_~queue~0.base))) (or (not (= (+ (select .cse6 .cse1) 1) 0)) (not (= (select .cse6 .cse2) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse4) (select .cse6 .cse5)) 1))))))))) (= (mod c_~v_assert~0 256) 0) (<= (+ c_~back~0 1) c_~front~0) (< .cse10 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse10))) is different from false [2022-12-14 16:13:26,370 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:26,371 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 126 treesize of output 90 [2022-12-14 16:13:26,413 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:13:26,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 4130 treesize of output 3734 [2022-12-14 16:13:26,435 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 3398 treesize of output 2950 [2022-12-14 16:13:26,484 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:13:26,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3248 treesize of output 2956 [2022-12-14 16:13:26,536 INFO L321 Elim1Store]: treesize reduction 14, result has 73.6 percent of original size [2022-12-14 16:13:26,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2918 treesize of output 2296 [2022-12-14 16:13:29,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:29,602 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 126 treesize of output 90 [2022-12-14 16:13:29,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 16:13:29,630 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:13:29,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 626 treesize of output 549 [2022-12-14 16:13:29,659 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:13:29,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 541 treesize of output 419 [2022-12-14 16:13:29,688 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-14 16:13:29,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 411 treesize of output 354 [2022-12-14 16:13:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 16:13:30,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500730710] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:13:30,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1480685430] [2022-12-14 16:13:30,054 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:13:30,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:13:30,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 40 [2022-12-14 16:13:30,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786287854] [2022-12-14 16:13:30,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:13:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-14 16:13:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:13:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-14 16:13:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=990, Unknown=17, NotChecked=426, Total=1640 [2022-12-14 16:13:30,057 INFO L87 Difference]: Start difference. First operand 1090 states and 2938 transitions. Second operand has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:31,874 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (+ c_~front~0 1))) (let ((.cse6 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse7 (< .cse11 0)) (.cse8 (not (< c_~back~0 c_~n~0))) (.cse9 (not (<= 0 c_~back~0))) (.cse10 (<= c_~n~0 .cse11))) (and (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or .cse0 .cse1 (not (= (+ (select .cse2 (+ c_~queue~0.offset .cse3 4)) 1) 0)) (let ((.cse4 (select .cse2 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)) 1)))) .cse7 .cse8 (not (= (select .cse2 (+ c_~queue~0.offset .cse3)) 1)) .cse9 .cse10)) (<= c_~v_assert~0 1) (or (and (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse6 .cse3)) .cse0 .cse1 .cse7 .cse8 .cse9 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10) (<= 1 c_~v_assert~0) (= c_~sum~0 0)))) is different from false [2022-12-14 16:13:35,752 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)))))) (< c_~front~0 0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-12-14 16:13:35,839 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~front~0 1))) (or (let ((.cse5 (* c_~back~0 4))) (let ((.cse1 (select .cse4 (+ c_~queue~0.offset .cse5 4))) (.cse0 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset .cse5)))) (and (or .cse0 (not (= (+ .cse1 1) 0)) .cse2 (not (= .cse3 1))) (or (not (= .cse1 1)) .cse0 (not .cse2) (not (= (+ .cse3 1) 0)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (select .cse4 (+ c_~queue~0.offset .cse8))) (.cse7 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse7)) 1))))) (< .cse9 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse9))) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 1 c_~v_assert~0) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= c_~sum~0 0)) is different from false [2022-12-14 16:13:37,303 WARN L837 $PredicateComparison]: unable to prove that (and (or (<= c_~n~0 c_~front~0) (<= c_~back~0 c_~front~0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse0)))))) (< c_~front~0 0)) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-12-14 16:13:38,889 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse9 (+ c_~front~0 1))) (or (let ((.cse5 (* c_~back~0 4))) (let ((.cse1 (select .cse4 (+ c_~queue~0.offset .cse5 4))) (.cse0 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset .cse5)))) (and (or .cse0 (not (= (+ .cse1 1) 0)) .cse2 (not (= .cse3 1))) (or (not (= .cse1 1)) .cse0 (not .cse2) (not (= (+ .cse3 1) 0)))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse6 (select .cse4 (+ c_~queue~0.offset .cse8))) (.cse7 (+ c_~queue~0.offset .cse8 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse7)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse6 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse7)) 1))))) (< .cse9 0) (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0)) (<= c_~n~0 .cse9))) (not (<= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0))) is different from false [2022-12-14 16:13:39,488 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (let ((.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (+ c_~front~0 1))) (or (let ((.cse1 (<= c_~back~0 c_~front~0)) (.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse2 (select .cse3 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) .cse1 (not (= (+ .cse2 1) 0))) (or .cse1 .cse0 (not (= .cse2 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (select .cse3 (+ c_~queue~0.offset .cse6))) (.cse5 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_538 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)))) (forall ((v_ArrVal_538 (Array Int Int))) (<= (+ c_~sum~0 .cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_538) c_~queue~0.base) .cse5)) 1))))) (< .cse7 0) (<= c_~n~0 .cse7)))) is different from false [2022-12-14 16:13:39,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:13:39,709 INFO L93 Difference]: Finished difference Result 1661 states and 3955 transitions. [2022-12-14 16:13:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-12-14 16:13:39,710 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 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 29 [2022-12-14 16:13:39,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:13:39,717 INFO L225 Difference]: With dead ends: 1661 [2022-12-14 16:13:39,717 INFO L226 Difference]: Without dead ends: 1081 [2022-12-14 16:13:39,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 110 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 3345 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1963, Invalid=7906, Unknown=79, NotChecked=2484, Total=12432 [2022-12-14 16:13:39,719 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 833 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 149 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 3243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 1350 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-14 16:13:39,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 54 Invalid, 3243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1726 Invalid, 18 Unknown, 1350 Unchecked, 1.9s Time] [2022-12-14 16:13:39,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2022-12-14 16:13:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 537. [2022-12-14 16:13:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 2.4402985074626864) internal successors, (1308), 536 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1308 transitions. [2022-12-14 16:13:39,737 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1308 transitions. Word has length 29 [2022-12-14 16:13:39,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:13:39,737 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 1308 transitions. [2022-12-14 16:13:39,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:39,738 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1308 transitions. [2022-12-14 16:13:39,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:13:39,739 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:13:39,739 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:13:39,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-14 16:13:39,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 16:13:39,940 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:13:39,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:13:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -499958318, now seen corresponding path program 10 times [2022-12-14 16:13:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:13:39,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67182532] [2022-12-14 16:13:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:13:39,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:13:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:13:41,229 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:13:41,230 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:13:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67182532] [2022-12-14 16:13:41,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67182532] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:13:41,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946155865] [2022-12-14 16:13:41,230 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:13:41,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:13:41,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:13:41,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:13:41,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-14 16:13:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:13:41,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 16:13:41,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:13:41,550 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:41,551 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 48 treesize of output 14 [2022-12-14 16:13:41,607 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:13:41,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:13:41,972 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:13:41,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 194 [2022-12-14 16:13:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:13:42,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946155865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:13:42,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1379254031] [2022-12-14 16:13:42,344 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:13:42,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:13:42,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 31 [2022-12-14 16:13:42,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953643870] [2022-12-14 16:13:42,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:13:42,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-14 16:13:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:13:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-14 16:13:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2022-12-14 16:13:42,346 INFO L87 Difference]: Start difference. First operand 537 states and 1308 transitions. Second operand has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:13:45,385 INFO L93 Difference]: Finished difference Result 1384 states and 3411 transitions. [2022-12-14 16:13:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-12-14 16:13:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 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 30 [2022-12-14 16:13:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:13:45,388 INFO L225 Difference]: With dead ends: 1384 [2022-12-14 16:13:45,388 INFO L226 Difference]: Without dead ends: 1320 [2022-12-14 16:13:45,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1397 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=808, Invalid=4594, Unknown=0, NotChecked=0, Total=5402 [2022-12-14 16:13:45,389 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 414 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1466 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 16:13:45,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 31 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 16:13:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-12-14 16:13:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 712. [2022-12-14 16:13:45,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 2.490857946554149) internal successors, (1771), 711 states have internal predecessors, (1771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1771 transitions. [2022-12-14 16:13:45,402 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1771 transitions. Word has length 30 [2022-12-14 16:13:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:13:45,402 INFO L495 AbstractCegarLoop]: Abstraction has 712 states and 1771 transitions. [2022-12-14 16:13:45,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.09375) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1771 transitions. [2022-12-14 16:13:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:13:45,403 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:13:45,403 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:13:45,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-14 16:13:45,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 16:13:45,605 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:13:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:13:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1046910282, now seen corresponding path program 11 times [2022-12-14 16:13:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:13:45,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022091797] [2022-12-14 16:13:45,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:13:45,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:13:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:13:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:13:47,290 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:13:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022091797] [2022-12-14 16:13:47,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022091797] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:13:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550548235] [2022-12-14 16:13:47,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:13:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:13:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:13:47,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:13:47,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-14 16:13:47,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 16:13:47,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:13:47,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 16:13:47,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:13:47,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:13:47,708 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-12-14 16:13:47,893 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:47,894 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 48 treesize of output 14 [2022-12-14 16:13:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:13:47,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:13:48,306 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse8 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse8)) (.cse3 (+ c_~queue~0.offset .cse8 4)) (.cse1 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or (and (forall ((v_ArrVal_643 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (<= (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 .cse3)) 1)))) (forall ((v_ArrVal_643 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (or (not (= (select .cse4 .cse1) 1)) (<= 0 (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))))))) .cse5) (or (and (forall ((v_ArrVal_643 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse2) (select .cse6 .cse3))) (not (= (+ (select .cse6 .cse1) 1) 0))))) (forall ((v_ArrVal_643 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_643) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse2) (select .cse7 .cse3)) 1) (not (= (+ (select .cse7 .cse1) 1) 0)))))) (not .cse5)))))) is different from false [2022-12-14 16:13:48,449 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:13:48,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 497 treesize of output 417 [2022-12-14 16:13:48,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:48,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 268 [2022-12-14 16:13:48,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:48,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 249 [2022-12-14 16:13:48,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:48,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 222 treesize of output 230 [2022-12-14 16:13:48,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:48,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 211 [2022-12-14 16:13:51,197 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2022-12-14 16:13:51,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550548235] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:13:51,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [457638819] [2022-12-14 16:13:51,198 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:13:51,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:13:51,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 35 [2022-12-14 16:13:51,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671715412] [2022-12-14 16:13:51,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:13:51,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 16:13:51,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:13:51,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 16:13:51,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1048, Unknown=1, NotChecked=66, Total=1260 [2022-12-14 16:13:51,200 INFO L87 Difference]: Start difference. First operand 712 states and 1771 transitions. Second operand has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:13:55,597 INFO L93 Difference]: Finished difference Result 1366 states and 3431 transitions. [2022-12-14 16:13:55,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-12-14 16:13:55,598 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 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 30 [2022-12-14 16:13:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:13:55,602 INFO L225 Difference]: With dead ends: 1366 [2022-12-14 16:13:55,602 INFO L226 Difference]: Without dead ends: 1318 [2022-12-14 16:13:55,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1175, Invalid=6838, Unknown=1, NotChecked=176, Total=8190 [2022-12-14 16:13:55,603 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 576 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 16:13:55,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 6 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1724 Invalid, 2 Unknown, 139 Unchecked, 1.3s Time] [2022-12-14 16:13:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-12-14 16:13:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 604. [2022-12-14 16:13:55,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 603 states have (on average 2.469320066334992) internal successors, (1489), 603 states have internal predecessors, (1489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:55,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1489 transitions. [2022-12-14 16:13:55,614 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1489 transitions. Word has length 30 [2022-12-14 16:13:55,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:13:55,614 INFO L495 AbstractCegarLoop]: Abstraction has 604 states and 1489 transitions. [2022-12-14 16:13:55,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 35 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:13:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1489 transitions. [2022-12-14 16:13:55,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:13:55,615 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:13:55,615 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:13:55,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-14 16:13:55,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 16:13:55,816 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:13:55,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:13:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1148367690, now seen corresponding path program 12 times [2022-12-14 16:13:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:13:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521460688] [2022-12-14 16:13:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:13:55,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:13:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:13:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:13:57,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:13:57,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521460688] [2022-12-14 16:13:57,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521460688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:13:57,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960893593] [2022-12-14 16:13:57,466 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:13:57,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:13:57,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:13:57,467 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:13:57,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-14 16:13:57,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:13:57,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:13:57,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 34 conjunts are in the unsatisfiable core [2022-12-14 16:13:57,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:13:57,720 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 25 treesize of output 7 [2022-12-14 16:13:57,795 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 27 treesize of output 11 [2022-12-14 16:13:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:13:57,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:13:57,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:57,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 68 treesize of output 48 [2022-12-14 16:13:58,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:13:58,238 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 224 treesize of output 172 [2022-12-14 16:13:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:13:58,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960893593] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:13:58,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290795578] [2022-12-14 16:13:58,451 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:13:58,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:13:58,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 32 [2022-12-14 16:13:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721959281] [2022-12-14 16:13:58,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:13:58,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-14 16:13:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:13:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-14 16:13:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 16:13:58,453 INFO L87 Difference]: Start difference. First operand 604 states and 1489 transitions. Second operand has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:01,829 INFO L93 Difference]: Finished difference Result 1766 states and 4471 transitions. [2022-12-14 16:14:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-14 16:14:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 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 30 [2022-12-14 16:14:01,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:01,833 INFO L225 Difference]: With dead ends: 1766 [2022-12-14 16:14:01,834 INFO L226 Difference]: Without dead ends: 1470 [2022-12-14 16:14:01,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=666, Invalid=3890, Unknown=0, NotChecked=0, Total=4556 [2022-12-14 16:14:01,834 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 376 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:01,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 16 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 16:14:01,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2022-12-14 16:14:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 685. [2022-12-14 16:14:01,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 684 states have (on average 2.4853801169590644) internal successors, (1700), 684 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1700 transitions. [2022-12-14 16:14:01,846 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1700 transitions. Word has length 30 [2022-12-14 16:14:01,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:01,846 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 1700 transitions. [2022-12-14 16:14:01,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1700 transitions. [2022-12-14 16:14:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:14:01,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:01,848 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:01,852 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-14 16:14:02,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 16:14:02,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:02,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:02,051 INFO L85 PathProgramCache]: Analyzing trace with hash -326447982, now seen corresponding path program 13 times [2022-12-14 16:14:02,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:02,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204149108] [2022-12-14 16:14:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:03,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:03,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204149108] [2022-12-14 16:14:03,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204149108] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:03,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738203086] [2022-12-14 16:14:03,303 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:14:03,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:03,304 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:03,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-14 16:14:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:03,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 16:14:03,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:03,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:14:03,700 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 44 treesize of output 42 [2022-12-14 16:14:03,746 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:03,746 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 48 treesize of output 14 [2022-12-14 16:14:03,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:14:03,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:03,951 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:14:04,100 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse3 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse3 4)) (.cse1 (select .cse2 (+ c_~queue~0.offset .cse3)))) (and (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0) c_~sum~0 .cse1) 1)) (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0) c_~sum~0 .cse1)))))) (let ((.cse4 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse4) (not (= (+ .cse5 1) 0))) (or .cse4 (not (= .cse5 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))) is different from false [2022-12-14 16:14:04,223 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:14:04,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2022-12-14 16:14:04,235 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 59 treesize of output 52 [2022-12-14 16:14:04,246 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 52 treesize of output 45 [2022-12-14 16:14:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-12-14 16:14:04,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738203086] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:04,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1471679817] [2022-12-14 16:14:04,829 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:04,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:04,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2022-12-14 16:14:04,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146646287] [2022-12-14 16:14:04,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:04,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-14 16:14:04,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:04,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-14 16:14:04,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1032, Unknown=2, NotChecked=134, Total=1332 [2022-12-14 16:14:04,831 INFO L87 Difference]: Start difference. First operand 685 states and 1700 transitions. Second operand has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:10,312 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse2 (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse4)) 1))) (.cse3 (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse4)))))) (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (and .cse2 .cse3)) (<= c_~sum~0 0) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) .cse2 (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) .cse3))) is different from false [2022-12-14 16:14:10,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (forall ((v_ArrVal_748 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0)) 1)) (<= 1 c_~v_assert~0) (forall ((v_ArrVal_748 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_748) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:14:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:10,679 INFO L93 Difference]: Finished difference Result 1971 states and 4978 transitions. [2022-12-14 16:14:10,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-14 16:14:10,679 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 16:14:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:10,683 INFO L225 Difference]: With dead ends: 1971 [2022-12-14 16:14:10,683 INFO L226 Difference]: Without dead ends: 1741 [2022-12-14 16:14:10,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 37 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1035, Invalid=5432, Unknown=29, NotChecked=644, Total=7140 [2022-12-14 16:14:10,684 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 477 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 40 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:10,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 26 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1314 Invalid, 30 Unknown, 316 Unchecked, 1.2s Time] [2022-12-14 16:14:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1741 states. [2022-12-14 16:14:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1741 to 736. [2022-12-14 16:14:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.4870748299319727) internal successors, (1828), 735 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:10,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1828 transitions. [2022-12-14 16:14:10,698 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1828 transitions. Word has length 30 [2022-12-14 16:14:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:10,699 INFO L495 AbstractCegarLoop]: Abstraction has 736 states and 1828 transitions. [2022-12-14 16:14:10,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1828 transitions. [2022-12-14 16:14:10,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:14:10,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:10,700 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:10,705 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-14 16:14:10,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 16:14:10,900 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1476520818, now seen corresponding path program 14 times [2022-12-14 16:14:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:10,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806532567] [2022-12-14 16:14:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:12,019 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806532567] [2022-12-14 16:14:12,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806532567] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:12,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841233789] [2022-12-14 16:14:12,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:14:12,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:12,020 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:12,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-14 16:14:12,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 16:14:12,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:14:12,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-14 16:14:12,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:12,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:14:12,434 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 32 treesize of output 32 [2022-12-14 16:14:12,551 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:12,551 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 48 treesize of output 14 [2022-12-14 16:14:12,605 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 16:14:12,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:12,797 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_801 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) 1)) (forall ((v_ArrVal_801 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))))))))) is different from false [2022-12-14 16:14:12,834 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod c_~v_assert~0 256) 0) (let ((.cse6 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse6)) (.cse4 (+ c_~queue~0.offset .cse6 4))) (and (forall ((v_ArrVal_801 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4))) 1)) (forall ((v_ArrVal_801 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse3) (select .cse5 .cse4))))))))) is different from false [2022-12-14 16:14:12,934 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:14:12,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 282 treesize of output 252 [2022-12-14 16:14:12,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:12,947 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 71 treesize of output 58 [2022-12-14 16:14:12,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:12,961 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 58 treesize of output 45 [2022-12-14 16:14:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-12-14 16:14:13,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841233789] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:13,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [371073413] [2022-12-14 16:14:13,440 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:13,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:13,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2022-12-14 16:14:13,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668238806] [2022-12-14 16:14:13,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:13,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-14 16:14:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-14 16:14:13,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=926, Unknown=2, NotChecked=126, Total=1190 [2022-12-14 16:14:13,442 INFO L87 Difference]: Start difference. First operand 736 states and 1828 transitions. Second operand has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:16,431 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4)) (.cse2 (+ c_~queue~0.offset .cse4 4))) (and (forall ((v_ArrVal_801 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))) 1)) (forall ((v_ArrVal_801 (Array Int Int))) (<= 0 (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_801) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))))))))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:14:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:17,508 INFO L93 Difference]: Finished difference Result 1675 states and 4343 transitions. [2022-12-14 16:14:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-12-14 16:14:17,508 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 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 30 [2022-12-14 16:14:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:17,512 INFO L225 Difference]: With dead ends: 1675 [2022-12-14 16:14:17,512 INFO L226 Difference]: Without dead ends: 1593 [2022-12-14 16:14:17,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 2342 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1235, Invalid=6430, Unknown=3, NotChecked=522, Total=8190 [2022-12-14 16:14:17,513 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 580 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:17,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 5 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1721 Invalid, 2 Unknown, 303 Unchecked, 1.3s Time] [2022-12-14 16:14:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-12-14 16:14:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 703. [2022-12-14 16:14:17,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 702 states have (on average 2.494301994301994) internal successors, (1751), 702 states have internal predecessors, (1751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:17,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1751 transitions. [2022-12-14 16:14:17,530 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1751 transitions. Word has length 30 [2022-12-14 16:14:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:17,530 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 1751 transitions. [2022-12-14 16:14:17,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.2285714285714286) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:17,530 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1751 transitions. [2022-12-14 16:14:17,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:14:17,531 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:17,531 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:17,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-14 16:14:17,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:17,733 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:17,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:17,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1149987154, now seen corresponding path program 15 times [2022-12-14 16:14:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:17,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763370425] [2022-12-14 16:14:17,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:17,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:18,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:18,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763370425] [2022-12-14 16:14:18,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763370425] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:18,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137639525] [2022-12-14 16:14:18,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:14:18,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:18,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:18,890 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:18,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-14 16:14:18,970 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:14:18,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:14:18,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 16:14:18,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:19,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:14:19,261 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 44 treesize of output 42 [2022-12-14 16:14:19,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:19,308 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 48 treesize of output 14 [2022-12-14 16:14:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:14:19,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:19,587 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~front~0 4))) (let ((.cse0 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2))) (.cse1 (+ c_~queue~0.offset .cse2 4))) (and (forall ((v_ArrVal_854 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse1)))) (forall ((v_ArrVal_854 (Array Int Int))) (<= (+ c_~sum~0 .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse1)) 1))))) is different from false [2022-12-14 16:14:19,777 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:14:19,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2022-12-14 16:14:19,787 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 59 treesize of output 52 [2022-12-14 16:14:19,796 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 52 treesize of output 45 [2022-12-14 16:14:20,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-12-14 16:14:20,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137639525] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:20,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1932531553] [2022-12-14 16:14:20,317 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:20,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:20,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2022-12-14 16:14:20,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761495773] [2022-12-14 16:14:20,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:20,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 16:14:20,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:20,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 16:14:20,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1042, Unknown=11, NotChecked=66, Total=1260 [2022-12-14 16:14:20,319 INFO L87 Difference]: Start difference. First operand 703 states and 1751 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:22,633 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (let ((.cse5 (select .cse4 (+ c_~queue~0.offset .cse7))) (.cse6 (+ c_~queue~0.offset .cse7 4))) (let ((.cse0 (forall ((v_ArrVal_854 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse6))))) (.cse1 (forall ((v_ArrVal_854 (Array Int Int))) (<= (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse6)) 1)))) (and .cse0 (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (and .cse0 .cse1) (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1)))))) .cse1 (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1))))) is different from false [2022-12-14 16:14:22,687 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~front~0 4))) (let ((.cse5 (select .cse4 (+ c_~queue~0.offset .cse7))) (.cse6 (+ c_~queue~0.offset .cse7 4))) (let ((.cse0 (forall ((v_ArrVal_854 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse6))))) (.cse1 (forall ((v_ArrVal_854 (Array Int Int))) (<= (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse6)) 1)))) (and .cse0 (or (and .cse0 .cse1) (let ((.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse2 (not (= .cse3 1)))))) .cse1)))) is different from false [2022-12-14 16:14:22,759 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (not (<= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (forall ((v_ArrVal_854 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_854 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_854) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:14:23,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:23,984 INFO L93 Difference]: Finished difference Result 1393 states and 3589 transitions. [2022-12-14 16:14:23,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-12-14 16:14:23,984 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 16:14:23,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:23,987 INFO L225 Difference]: With dead ends: 1393 [2022-12-14 16:14:23,987 INFO L226 Difference]: Without dead ends: 1321 [2022-12-14 16:14:23,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=973, Invalid=5345, Unknown=18, NotChecked=636, Total=6972 [2022-12-14 16:14:23,988 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 628 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 53 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 304 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:23,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 27 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2025 Invalid, 32 Unknown, 304 Unchecked, 1.5s Time] [2022-12-14 16:14:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2022-12-14 16:14:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 718. [2022-12-14 16:14:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 2.504881450488145) internal successors, (1796), 717 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:24,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1796 transitions. [2022-12-14 16:14:24,003 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1796 transitions. Word has length 30 [2022-12-14 16:14:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:24,003 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 1796 transitions. [2022-12-14 16:14:24,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1796 transitions. [2022-12-14 16:14:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 16:14:24,005 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:24,005 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:24,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-14 16:14:24,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:24,207 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:24,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1873591758, now seen corresponding path program 16 times [2022-12-14 16:14:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:24,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834303464] [2022-12-14 16:14:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:24,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:25,707 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834303464] [2022-12-14 16:14:25,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834303464] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:25,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162174253] [2022-12-14 16:14:25,708 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:14:25,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:25,708 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:25,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-14 16:14:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:25,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-14 16:14:25,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:26,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:14:26,100 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 44 treesize of output 42 [2022-12-14 16:14:26,145 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:26,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 48 treesize of output 14 [2022-12-14 16:14:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 16:14:26,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:26,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_907 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_907) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_907 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_907) c_~queue~0.base) .cse0)))))) is different from false [2022-12-14 16:14:26,762 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-14 16:14:26,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2022-12-14 16:14:26,773 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 59 treesize of output 52 [2022-12-14 16:14:26,784 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 52 treesize of output 45 [2022-12-14 16:14:27,282 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:14:27,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162174253] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:27,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1412443661] [2022-12-14 16:14:27,282 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:27,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:27,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2022-12-14 16:14:27,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576154542] [2022-12-14 16:14:27,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:27,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-14 16:14:27,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-14 16:14:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1064, Unknown=1, NotChecked=66, Total=1260 [2022-12-14 16:14:27,284 INFO L87 Difference]: Start difference. First operand 718 states and 1796 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:42,552 INFO L93 Difference]: Finished difference Result 2072 states and 5347 transitions. [2022-12-14 16:14:42,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-14 16:14:42,553 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-14 16:14:42,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:42,557 INFO L225 Difference]: With dead ends: 2072 [2022-12-14 16:14:42,557 INFO L226 Difference]: Without dead ends: 1702 [2022-12-14 16:14:42,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=1074, Invalid=6185, Unknown=55, NotChecked=168, Total=7482 [2022-12-14 16:14:42,558 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 504 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 48 mSolverCounterUnsat, 52 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 52 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:42,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 3 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1588 Invalid, 52 Unknown, 121 Unchecked, 1.8s Time] [2022-12-14 16:14:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2022-12-14 16:14:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 595. [2022-12-14 16:14:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 2.4814814814814814) internal successors, (1474), 594 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1474 transitions. [2022-12-14 16:14:42,569 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 1474 transitions. Word has length 30 [2022-12-14 16:14:42,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:42,570 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 1474 transitions. [2022-12-14 16:14:42,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 35 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:42,570 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 1474 transitions. [2022-12-14 16:14:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 16:14:42,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:42,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:42,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-14 16:14:42,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:42,772 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:42,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1943407794, now seen corresponding path program 17 times [2022-12-14 16:14:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:42,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650060896] [2022-12-14 16:14:42,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:42,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:42,987 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650060896] [2022-12-14 16:14:42,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650060896] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:42,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601839339] [2022-12-14 16:14:42,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:14:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:42,988 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:42,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-14 16:14:43,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 16:14:43,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:14:43,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 16:14:43,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:43,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 124 treesize of output 92 [2022-12-14 16:14:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:43,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:43,579 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 136 treesize of output 104 [2022-12-14 16:14:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:43,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601839339] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:43,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216347743] [2022-12-14 16:14:43,719 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:43,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:43,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2022-12-14 16:14:43,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484545693] [2022-12-14 16:14:43,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:43,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 16:14:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:43,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 16:14:43,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-12-14 16:14:43,720 INFO L87 Difference]: Start difference. First operand 595 states and 1474 transitions. Second operand has 25 states, 25 states have (on average 2.84) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:44,167 INFO L93 Difference]: Finished difference Result 574 states and 1401 transitions. [2022-12-14 16:14:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 16:14:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-12-14 16:14:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:44,169 INFO L225 Difference]: With dead ends: 574 [2022-12-14 16:14:44,170 INFO L226 Difference]: Without dead ends: 467 [2022-12-14 16:14:44,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 16:14:44,170 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 88 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:44,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 62 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 16:14:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-12-14 16:14:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2022-12-14 16:14:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 2.6051502145922747) internal successors, (1214), 466 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:44,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 1214 transitions. [2022-12-14 16:14:44,177 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 1214 transitions. Word has length 31 [2022-12-14 16:14:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:44,177 INFO L495 AbstractCegarLoop]: Abstraction has 467 states and 1214 transitions. [2022-12-14 16:14:44,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.84) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 1214 transitions. [2022-12-14 16:14:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-14 16:14:44,178 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:44,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:44,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-14 16:14:44,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-12-14 16:14:44,380 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:44,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:44,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1359284128, now seen corresponding path program 18 times [2022-12-14 16:14:44,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:44,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932677466] [2022-12-14 16:14:44,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:44,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:14:44,527 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932677466] [2022-12-14 16:14:44,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932677466] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:44,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153174231] [2022-12-14 16:14:44,527 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 16:14:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:44,528 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:44,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-14 16:14:44,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 16:14:44,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:14:44,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-14 16:14:44,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:44,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:44,715 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 170 treesize of output 120 [2022-12-14 16:14:44,741 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:14:44,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:44,917 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 16:14:44,918 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 193 treesize of output 145 [2022-12-14 16:14:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 16:14:44,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153174231] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:44,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2007490056] [2022-12-14 16:14:44,978 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:44,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:44,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-12-14 16:14:44,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236584574] [2022-12-14 16:14:44,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:44,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 16:14:44,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 16:14:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-12-14 16:14:44,979 INFO L87 Difference]: Start difference. First operand 467 states and 1214 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:14:45,139 INFO L93 Difference]: Finished difference Result 1099 states and 2795 transitions. [2022-12-14 16:14:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 16:14:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 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 32 [2022-12-14 16:14:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:14:45,142 INFO L225 Difference]: With dead ends: 1099 [2022-12-14 16:14:45,142 INFO L226 Difference]: Without dead ends: 1095 [2022-12-14 16:14:45,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2022-12-14 16:14:45,142 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 93 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 35 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 16:14:45,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 35 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 16:14:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-12-14 16:14:45,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 600. [2022-12-14 16:14:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 2.657762938230384) internal successors, (1592), 599 states have internal predecessors, (1592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:45,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 1592 transitions. [2022-12-14 16:14:45,152 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 1592 transitions. Word has length 32 [2022-12-14 16:14:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:14:45,152 INFO L495 AbstractCegarLoop]: Abstraction has 600 states and 1592 transitions. [2022-12-14 16:14:45,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 12 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 1592 transitions. [2022-12-14 16:14:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 16:14:45,153 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:14:45,153 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:14:45,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-14 16:14:45,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-14 16:14:45,355 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:14:45,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:14:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1182952868, now seen corresponding path program 19 times [2022-12-14 16:14:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:14:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019382559] [2022-12-14 16:14:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:14:45,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:14:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:47,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:14:47,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019382559] [2022-12-14 16:14:47,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019382559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:14:47,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124676678] [2022-12-14 16:14:47,035 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 16:14:47,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:14:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:14:47,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:14:47,036 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-14 16:14:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:14:47,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 16:14:47,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:14:47,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:14:47,695 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 44 treesize of output 42 [2022-12-14 16:14:47,903 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:47,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 18 [2022-12-14 16:14:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:14:47,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:14:48,345 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) is different from false [2022-12-14 16:14:48,475 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse7 (+ c_~back~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (* c_~back~0 4))) (let ((.cse0 (select .cse5 (+ c_~queue~0.offset .cse6 4))) (.cse2 (not (<= 0 .cse7))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse7 c_~n~0))) (.cse3 (select .cse5 (+ c_~queue~0.offset .cse6)))) (and (or (not (= .cse0 1)) (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or (not (= (+ .cse0 1) 0)) .cse2 .cse1 .cse4 (not (= .cse3 1)))))) (let ((.cse13 (* c_~front~0 4))) (let ((.cse9 (+ c_~queue~0.offset .cse13 4)) (.cse10 (+ c_~queue~0.offset .cse13 8)) (.cse11 (+ c_~queue~0.offset .cse13))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse9) (select .cse8 .cse10) (select .cse8 .cse11))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse12 .cse9) (select .cse12 .cse10) (select .cse12 .cse11))))))))) is different from false [2022-12-14 16:14:48,678 INFO L321 Elim1Store]: treesize reduction 26, result has 82.3 percent of original size [2022-12-14 16:14:48,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 370 treesize of output 372 [2022-12-14 16:14:48,697 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:48,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 69 [2022-12-14 16:14:48,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:14:48,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 49 [2022-12-14 16:14:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-14 16:14:50,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124676678] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 16:14:50,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744842758] [2022-12-14 16:14:50,568 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgJoinThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-14 16:14:50,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 16:14:50,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 47 [2022-12-14 16:14:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124354880] [2022-12-14 16:14:50,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 16:14:50,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-14 16:14:50,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 16:14:50,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-14 16:14:50,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1844, Unknown=7, NotChecked=178, Total=2256 [2022-12-14 16:14:50,570 INFO L87 Difference]: Start difference. First operand 600 states and 1592 transitions. Second operand has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:14:55,738 WARN L837 $PredicateComparison]: unable to prove that (and (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-14 16:14:57,004 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-14 16:15:01,102 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) (<= 1 c_~v_assert~0)) is different from false [2022-12-14 16:15:09,517 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~front~0 4))) (let ((.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (+ c_~queue~0.offset .cse8))) (let ((.cse9 (+ c_~sum~0 (select .cse2 .cse6)))) (and (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select .cse2 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse4 (+ c_~queue~0.offset .cse8 4)) (.cse5 (+ c_~queue~0.offset .cse8 8))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse4) (select .cse3 .cse5) (select .cse3 .cse6))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse7 .cse4) (select .cse7 .cse5) (select .cse7 .cse6))))))) (not (<= 0 c_~back~0))) (= (select .cse2 (+ .cse8 4)) 1) (<= .cse9 0) (= c_~queue~0.offset 0) (<= 0 .cse9) (<= 1 c_~v_assert~0) (< 3 .cse6) (<= c_~front~0 1))))) is different from false [2022-12-14 16:15:17,580 WARN L837 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse7 (+ c_~back~0 1)) (.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (* c_~back~0 4))) (let ((.cse0 (select .cse5 (+ c_~queue~0.offset .cse6 4))) (.cse2 (not (<= 0 .cse7))) (.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (not (< .cse7 c_~n~0))) (.cse3 (select .cse5 (+ c_~queue~0.offset .cse6)))) (and (or (not (= .cse0 1)) (not .cse1) .cse2 (not (= (+ .cse3 1) 0)) .cse4) (or (not (= (+ .cse0 1) 0)) .cse2 .cse1 .cse4 (not (= .cse3 1)))))) (let ((.cse13 (* c_~front~0 4))) (let ((.cse9 (+ c_~queue~0.offset .cse13 4)) (.cse10 (+ c_~queue~0.offset .cse13 8)) (.cse11 (+ c_~queue~0.offset .cse13))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse9) (select .cse8 .cse10) (select .cse8 .cse11))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse12 .cse9) (select .cse12 .cse10) (select .cse12 .cse11))))))))) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:15:47,093 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 74 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:15:47,611 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256))) (and (not (<= .cse0 0)) (<= 0 c_~sum~0) (or (= .cse0 0) (let ((.cse8 (+ c_~back~0 1)) (.cse6 (select |c_#memory_int| c_~queue~0.base)) (.cse7 (* c_~back~0 4))) (let ((.cse1 (select .cse6 (+ c_~queue~0.offset .cse7 4))) (.cse3 (not (<= 0 .cse8))) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse5 (not (< .cse8 c_~n~0))) (.cse4 (select .cse6 (+ c_~queue~0.offset .cse7)))) (and (or (not (= .cse1 1)) (not .cse2) .cse3 (not (= (+ .cse4 1) 0)) .cse5) (or (not (= (+ .cse1 1) 0)) .cse3 .cse2 .cse5 (not (= .cse4 1)))))) (let ((.cse14 (* c_~front~0 4))) (let ((.cse10 (+ c_~queue~0.offset .cse14 4)) (.cse11 (+ c_~queue~0.offset .cse14 8)) (.cse12 (+ c_~queue~0.offset .cse14))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse9 .cse10) (select .cse9 .cse11) (select .cse9 .cse12))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse13 .cse10) (select .cse13 .cse11) (select .cse13 .cse12))))))))) (<= c_~sum~0 1))) is different from false [2022-12-14 16:15:50,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse10 (select |c_#memory_int| c_~queue~0.base)) (.cse4 (+ c_~queue~0.offset .cse6))) (let ((.cse9 (select .cse10 .cse4)) (.cse2 (+ c_~queue~0.offset .cse6 4))) (let ((.cse0 (select .cse10 (+ c_~queue~0.offset .cse6 (- 8)))) (.cse8 (select .cse10 (+ c_~queue~0.offset .cse6 (- 4)))) (.cse7 (+ c_~sum~0 .cse9 (select .cse10 .cse2)))) (and (= .cse0 1) (= |c_thread1Thread1of1ForFork1_~cond~0#1| c_~v_assert~0) (<= c_~v_assert~0 1) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse3 (+ c_~queue~0.offset .cse6 8))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4)))))))) (<= c_~front~0 2) (<= .cse7 1) (<= 2 c_~front~0) (= c_~queue~0.offset 0) (<= 1 c_~v_assert~0) (= (+ .cse8 1) 0) (= .cse9 1) (= c_~sum~0 (+ .cse0 .cse8)) (<= 0 .cse7)))))) is different from false [2022-12-14 16:15:58,956 WARN L233 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 74 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:15:59,691 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 0 c_~sum~0) (<= c_~sum~0 1) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) is different from false [2022-12-14 16:15:59,938 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse5))) (let ((.cse6 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse3)))) (and (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse1 (+ c_~queue~0.offset .cse5 4)) (.cse2 (+ c_~queue~0.offset .cse5 8))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2) (select .cse0 .cse3))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse1) (select .cse4 .cse2) (select .cse4 .cse3)))))))) (<= .cse6 1) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= 0 .cse6) (<= (div |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0))))) is different from false [2022-12-14 16:16:08,909 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 43 DAG size of output: 32 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 16:16:09,397 WARN L837 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse1 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse0) (not (= (+ .cse1 1) 0))) (or .cse0 (not (= .cse1 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (not (< c_~back~0 c_~n~0)) (let ((.cse7 (* c_~front~0 4))) (let ((.cse3 (+ c_~queue~0.offset .cse7 4)) (.cse4 (+ c_~queue~0.offset .cse7 8)) (.cse5 (+ c_~queue~0.offset .cse7))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse2 .cse3) (select .cse2 .cse4) (select .cse2 .cse5))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse6 .cse3) (select .cse6 .cse4) (select .cse6 .cse5)))))))) (not (<= 0 c_~back~0))) (<= 0 c_~sum~0) (<= c_~sum~0 1)) is different from false [2022-12-14 16:16:30,088 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~front~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse6))) (let ((.cse0 (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256)) (.cse7 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse4)))) (and (not (<= .cse0 0)) (or (= .cse0 0) (let ((.cse2 (+ c_~queue~0.offset .cse6 4)) (.cse3 (+ c_~queue~0.offset .cse6 8))) (and (forall ((v_ArrVal_1060 (Array Int Int))) (<= (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3) (select .cse1 .cse4))) 1)) (forall ((v_ArrVal_1060 (Array Int Int))) (<= 0 (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1060) c_~queue~0.base))) (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 .cse3) (select .cse5 .cse4)))))))) (<= .cse7 1) (<= 0 .cse7))))) is different from false [2022-12-14 16:16:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 16:16:41,393 INFO L93 Difference]: Finished difference Result 6030 states and 16366 transitions. [2022-12-14 16:16:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2022-12-14 16:16:41,394 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 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 34 [2022-12-14 16:16:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 16:16:41,402 INFO L225 Difference]: With dead ends: 6030 [2022-12-14 16:16:41,403 INFO L226 Difference]: Without dead ends: 5526 [2022-12-14 16:16:41,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 41 SyntacticMatches, 25 SemanticMatches, 257 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 26002 ImplicationChecksByTransitivity, 95.4s TimeCoverageRelationStatistics Valid=6925, Invalid=52862, Unknown=535, NotChecked=6500, Total=66822 [2022-12-14 16:16:41,405 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 847 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 11835 mSolverCounterSat, 205 mSolverCounterUnsat, 676 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 15193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 11835 IncrementalHoareTripleChecker+Invalid, 676 IncrementalHoareTripleChecker+Unknown, 2477 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-12-14 16:16:41,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 66 Invalid, 15193 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [205 Valid, 11835 Invalid, 676 Unknown, 2477 Unchecked, 16.6s Time] [2022-12-14 16:16:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2022-12-14 16:16:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 2126. [2022-12-14 16:16:41,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2126 states, 2125 states have (on average 2.7708235294117647) internal successors, (5888), 2125 states have internal predecessors, (5888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:16:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 5888 transitions. [2022-12-14 16:16:41,460 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 5888 transitions. Word has length 34 [2022-12-14 16:16:41,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 16:16:41,461 INFO L495 AbstractCegarLoop]: Abstraction has 2126 states and 5888 transitions. [2022-12-14 16:16:41,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 47 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 16:16:41,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 5888 transitions. [2022-12-14 16:16:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-12-14 16:16:41,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 16:16:41,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 16:16:41,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-14 16:16:41,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-14 16:16:41,664 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-14 16:16:41,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 16:16:41,666 INFO L85 PathProgramCache]: Analyzing trace with hash 183656088, now seen corresponding path program 20 times [2022-12-14 16:16:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 16:16:41,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572284807] [2022-12-14 16:16:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 16:16:41,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 16:16:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 16:16:43,232 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:16:43,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 16:16:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572284807] [2022-12-14 16:16:43,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572284807] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 16:16:43,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620796859] [2022-12-14 16:16:43,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 16:16:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 16:16:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 16:16:43,234 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 16:16:43,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2093b37-2789-48f6-a5b9-efa2ff53fe2b/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-14 16:16:43,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 16:16:43,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 16:16:43,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 54 conjunts are in the unsatisfiable core [2022-12-14 16:16:43,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 16:16:44,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 16:16:44,132 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 56 treesize of output 52 [2022-12-14 16:16:44,448 INFO L321 Elim1Store]: treesize reduction 40, result has 7.0 percent of original size [2022-12-14 16:16:44,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 21 [2022-12-14 16:16:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 16:16:44,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 16:16:47,722 INFO L321 Elim1Store]: treesize reduction 64, result has 85.2 percent of original size [2022-12-14 16:16:47,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 555 treesize of output 725 [2022-12-14 16:16:47,766 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:16:47,766 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 252 treesize of output 254 [2022-12-14 16:16:47,808 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:16:47,809 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 239 treesize of output 241 [2022-12-14 16:16:47,852 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:16:47,852 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 226 treesize of output 228 [2022-12-14 16:16:47,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 16:16:47,895 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 213 treesize of output 215