./Ultimate.py --spec /storage/repos/ultimate/trunk/examples/svcomp/properties/no-data-race.prp --file /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version efd9311c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/TaipanReach.xml -i /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i -s /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UTaipan-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-efd9311-m [2022-04-18 18:59:26,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-18 18:59:26,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-18 18:59:26,910 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-18 18:59:26,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-18 18:59:26,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-18 18:59:26,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-18 18:59:26,914 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-18 18:59:26,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-18 18:59:26,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-18 18:59:26,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-18 18:59:26,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-18 18:59:26,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-18 18:59:26,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-18 18:59:26,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-18 18:59:26,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-18 18:59:26,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-18 18:59:26,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-18 18:59:26,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-18 18:59:26,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-18 18:59:26,935 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-18 18:59:26,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-18 18:59:26,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-18 18:59:26,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-18 18:59:26,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-18 18:59:26,943 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-18 18:59:26,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-18 18:59:26,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-18 18:59:26,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-18 18:59:26,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-18 18:59:26,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-18 18:59:26,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-18 18:59:26,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-18 18:59:26,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-18 18:59:26,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-18 18:59:26,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-18 18:59:26,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-18 18:59:26,949 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-18 18:59:26,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-18 18:59:26,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-18 18:59:26,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-18 18:59:26,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-18 18:59:26,951 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-04-18 18:59:26,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-18 18:59:26,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-18 18:59:26,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-18 18:59:26,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-18 18:59:26,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-18 18:59:26,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-18 18:59:26,978 INFO L138 SettingsManager]: * User list type=DISABLED [2022-04-18 18:59:26,979 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-04-18 18:59:26,979 INFO L138 SettingsManager]: * Explicit value domain=true [2022-04-18 18:59:26,979 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-04-18 18:59:26,980 INFO L138 SettingsManager]: * Octagon Domain=false [2022-04-18 18:59:26,980 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-04-18 18:59:26,980 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-04-18 18:59:26,980 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-04-18 18:59:26,980 INFO L138 SettingsManager]: * Interval Domain=false [2022-04-18 18:59:26,980 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-04-18 18:59:26,981 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-04-18 18:59:26,981 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-04-18 18:59:26,982 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-18 18:59:26,982 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-18 18:59:26,983 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-04-18 18:59:26,984 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-18 18:59:26,984 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-18 18:59:26,984 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-18 18:59:26,984 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-18 18:59:26,984 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-18 18:59:26,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 18:59:26,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-18 18:59:26,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-18 18:59:26,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-18 18:59:26,986 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UTaipan-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UTaipan-linux 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 ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16b049fb81e05ec2192b5dc6cabf7c8b89c1486d4e623332a0a01a89383c6c7d [2022-04-18 18:59:27,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-18 18:59:27,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-18 18:59:27,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-18 18:59:27,225 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-18 18:59:27,225 INFO L275 PluginConnector]: CDTParser initialized [2022-04-18 18:59:27,227 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i [2022-04-18 18:59:27,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e9b7f8b0f/290e0be3035647f9951f4437b218972a/FLAGe69d48715 [2022-04-18 18:59:27,666 INFO L306 CDTParser]: Found 1 translation units. [2022-04-18 18:59:27,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i [2022-04-18 18:59:27,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e9b7f8b0f/290e0be3035647f9951f4437b218972a/FLAGe69d48715 [2022-04-18 18:59:27,692 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/e9b7f8b0f/290e0be3035647f9951f4437b218972a [2022-04-18 18:59:27,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-18 18:59:27,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-04-18 18:59:27,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-18 18:59:27,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-18 18:59:27,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-18 18:59:27,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:59:27" (1/1) ... [2022-04-18 18:59:27,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b3851c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:27, skipping insertion in model container [2022-04-18 18:59:27,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 06:59:27" (1/1) ... [2022-04-18 18:59:27,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-18 18:59:27,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-18 18:59:27,870 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 18:59:27,968 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-04-18 18:59:27,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-04-18 18:59:28,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-04-18 18:59:28,008 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-04-18 18:59:28,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-04-18 18:59:28,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-04-18 18:59:28,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-04-18 18:59:28,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-04-18 18:59:28,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-04-18 18:59:28,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-04-18 18:59:28,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-04-18 18:59:28,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-04-18 18:59:28,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-04-18 18:59:28,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-04-18 18:59:28,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 18:59:28,039 INFO L203 MainTranslator]: Completed pre-run [2022-04-18 18:59:28,057 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-04-18 18:59:28,071 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[30448,30461] [2022-04-18 18:59:28,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[30811,30824] [2022-04-18 18:59:28,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31483,31496] [2022-04-18 18:59:28,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31534,31547] [2022-04-18 18:59:28,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31683,31696] [2022-04-18 18:59:28,095 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31760,31773] [2022-04-18 18:59:28,096 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31807,31820] [2022-04-18 18:59:28,098 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[31916,31929] [2022-04-18 18:59:28,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32035,32048] [2022-04-18 18:59:28,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32083,32096] [2022-04-18 18:59:28,102 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32160,32173] [2022-04-18 18:59:28,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32286,32299] [2022-04-18 18:59:28,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32869,32882] [2022-04-18 18:59:28,112 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/one_time_barrier_2t.i[32946,32959] [2022-04-18 18:59:28,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-18 18:59:28,142 INFO L208 MainTranslator]: Completed translation [2022-04-18 18:59:28,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28 WrapperNode [2022-04-18 18:59:28,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-18 18:59:28,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-04-18 18:59:28,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-04-18 18:59:28,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-04-18 18:59:28,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,175 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,221 INFO L137 Inliner]: procedures = 174, calls = 70, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 781 [2022-04-18 18:59:28,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-04-18 18:59:28,222 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-18 18:59:28,222 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-18 18:59:28,222 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-18 18:59:28,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-18 18:59:28,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-18 18:59:28,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-18 18:59:28,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-18 18:59:28,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (1/1) ... [2022-04-18 18:59:28,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-18 18:59:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 18:59:28,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-18 18:59:28,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-18 18:59:28,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-18 18:59:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-18 18:59:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-04-18 18:59:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure worker_fn [2022-04-18 18:59:28,365 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_fn [2022-04-18 18:59:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-18 18:59:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-18 18:59:28,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-18 18:59:28,368 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-04-18 18:59:28,514 INFO L234 CfgBuilder]: Building ICFG [2022-04-18 18:59:28,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-18 18:59:29,268 INFO L275 CfgBuilder]: Performing block encoding [2022-04-18 18:59:29,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-18 18:59:29,291 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-04-18 18:59:29,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:59:29 BoogieIcfgContainer [2022-04-18 18:59:29,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-18 18:59:29,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-18 18:59:29,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-18 18:59:29,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-18 18:59:29,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 06:59:27" (1/3) ... [2022-04-18 18:59:29,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b95cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:59:29, skipping insertion in model container [2022-04-18 18:59:29,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 06:59:28" (2/3) ... [2022-04-18 18:59:29,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72b95cab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 06:59:29, skipping insertion in model container [2022-04-18 18:59:29,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 06:59:29" (3/3) ... [2022-04-18 18:59:29,299 INFO L111 eAbstractionObserver]: Analyzing ICFG one_time_barrier_2t.i [2022-04-18 18:59:29,303 WARN L147 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-04-18 18:59:29,303 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-18 18:59:29,303 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2022-04-18 18:59:29,304 INFO L504 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-04-18 18:59:29,461 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-04-18 18:59:29,492 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-18 18:59:29,496 INFO L340 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 [2022-04-18 18:59:29,496 INFO L341 AbstractCegarLoop]: Starting to check reachability of 111 error locations. [2022-04-18 18:59:29,513 INFO L116 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-04-18 18:59:29,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 839 places, 898 transitions, 1804 flow [2022-04-18 18:59:29,523 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 839 places, 898 transitions, 1804 flow [2022-04-18 18:59:29,525 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 839 places, 898 transitions, 1804 flow [2022-04-18 18:59:29,896 INFO L129 PetriNetUnfolder]: 94/1320 cut-off events. [2022-04-18 18:59:29,896 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-04-18 18:59:29,932 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1326 conditions, 1320 events. 94/1320 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 4485 event pairs, 0 based on Foata normal form. 0/1110 useless extension candidates. Maximal degree in co-relation 792. Up to 4 conditions per place. [2022-04-18 18:59:29,999 INFO L116 LiptonReduction]: Number of co-enabled transitions 312440 [2022-04-18 19:02:16,066 INFO L131 LiptonReduction]: Checked pairs total: 5088989 [2022-04-18 19:02:16,067 INFO L133 LiptonReduction]: Total number of compositions: 661 [2022-04-18 19:02:16,074 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 437 places, 472 transitions, 952 flow [2022-04-18 19:02:16,957 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 45720 states, 44278 states have (on average 2.223971272415195) internal successors, (98473), 45719 states have internal predecessors, (98473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 45720 states, 44278 states have (on average 2.223971272415195) internal successors, (98473), 45719 states have internal predecessors, (98473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-04-18 19:02:17,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:17,087 INFO L499 BasicCegarLoop]: trace histogram [1, 1] [2022-04-18 19:02:17,087 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:17,091 INFO L85 PathProgramCache]: Analyzing trace with hash 97514, now seen corresponding path program 1 times [2022-04-18 19:02:17,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:17,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593359989] [2022-04-18 19:02:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:17,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-18 19:02:17,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:17,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593359989] [2022-04-18 19:02:17,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593359989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:17,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:17,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-04-18 19:02:17,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565682015] [2022-04-18 19:02:17,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:17,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-18 19:02:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:17,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-18 19:02:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 19:02:17,422 INFO L87 Difference]: Start difference. First operand has 45720 states, 44278 states have (on average 2.223971272415195) internal successors, (98473), 45719 states have internal predecessors, (98473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:18,219 INFO L93 Difference]: Finished difference Result 45715 states and 94411 transitions. [2022-04-18 19:02:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-18 19:02:18,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-04-18 19:02:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:18,429 INFO L225 Difference]: With dead ends: 45715 [2022-04-18 19:02:18,429 INFO L226 Difference]: Without dead ends: 45713 [2022-04-18 19:02:18,430 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-18 19:02:18,438 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:18,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 312 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 19:02:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45713 states. [2022-04-18 19:02:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45713 to 45713. [2022-04-18 19:02:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45713 states, 44278 states have (on average 2.132164957766837) internal successors, (94408), 45712 states have internal predecessors, (94408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45713 states to 45713 states and 94408 transitions. [2022-04-18 19:02:20,357 INFO L78 Accepts]: Start accepts. Automaton has 45713 states and 94408 transitions. Word has length 2 [2022-04-18 19:02:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:20,357 INFO L478 AbstractCegarLoop]: Abstraction has 45713 states and 94408 transitions. [2022-04-18 19:02:20,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 45713 states and 94408 transitions. [2022-04-18 19:02:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-04-18 19:02:20,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:20,358 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2022-04-18 19:02:20,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-18 19:02:20,358 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1206683915, now seen corresponding path program 1 times [2022-04-18 19:02:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:20,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76899547] [2022-04-18 19:02:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:02:20,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:20,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76899547] [2022-04-18 19:02:20,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76899547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:20,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:20,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642477930] [2022-04-18 19:02:20,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:20,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:20,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:20,439 INFO L87 Difference]: Start difference. First operand 45713 states and 94408 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:21,183 INFO L93 Difference]: Finished difference Result 45714 states and 94409 transitions. [2022-04-18 19:02:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-04-18 19:02:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:21,416 INFO L225 Difference]: With dead ends: 45714 [2022-04-18 19:02:21,416 INFO L226 Difference]: Without dead ends: 45714 [2022-04-18 19:02:21,416 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:21,421 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:21,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 19:02:21,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45714 states. [2022-04-18 19:02:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45714 to 45714. [2022-04-18 19:02:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45714 states, 44279 states have (on average 2.1321393888750877) internal successors, (94409), 45713 states have internal predecessors, (94409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:22,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45714 states to 45714 states and 94409 transitions. [2022-04-18 19:02:22,683 INFO L78 Accepts]: Start accepts. Automaton has 45714 states and 94409 transitions. Word has length 7 [2022-04-18 19:02:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:22,683 INFO L478 AbstractCegarLoop]: Abstraction has 45714 states and 94409 transitions. [2022-04-18 19:02:22,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45714 states and 94409 transitions. [2022-04-18 19:02:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-04-18 19:02:22,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:22,684 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:22,684 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-18 19:02:22,684 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:22,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1678028742, now seen corresponding path program 1 times [2022-04-18 19:02:22,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:22,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859440533] [2022-04-18 19:02:22,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:22,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:02:22,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:22,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859440533] [2022-04-18 19:02:22,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859440533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:02:22,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775108652] [2022-04-18 19:02:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:22,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:02:22,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:02:22,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-18 19:02:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:22,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 19:02:22,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:02:22,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:02:22,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:02:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-18 19:02:22,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775108652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:02:22,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2014801542] [2022-04-18 19:02:22,896 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:02:22,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:02:22,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2022-04-18 19:02:22,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311055823] [2022-04-18 19:02:22,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:02:22,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-18 19:02:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-18 19:02:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:02:22,902 INFO L87 Difference]: Start difference. First operand 45714 states and 94409 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:23,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:23,650 INFO L93 Difference]: Finished difference Result 45715 states and 94410 transitions. [2022-04-18 19:02:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 19:02:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-04-18 19:02:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:23,769 INFO L225 Difference]: With dead ends: 45715 [2022-04-18 19:02:23,770 INFO L226 Difference]: Without dead ends: 45715 [2022-04-18 19:02:23,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:02:23,771 INFO L913 BasicCegarLoop]: 312 mSDtfsCounter, 0 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:23,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-18 19:02:23,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45715 states. [2022-04-18 19:02:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45715 to 45715. [2022-04-18 19:02:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45715 states, 44280 states have (on average 2.1321138211382116) internal successors, (94410), 45714 states have internal predecessors, (94410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45715 states to 45715 states and 94410 transitions. [2022-04-18 19:02:24,680 INFO L78 Accepts]: Start accepts. Automaton has 45715 states and 94410 transitions. Word has length 8 [2022-04-18 19:02:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:24,680 INFO L478 AbstractCegarLoop]: Abstraction has 45715 states and 94410 transitions. [2022-04-18 19:02:24,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 45715 states and 94410 transitions. [2022-04-18 19:02:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-18 19:02:24,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:24,681 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2022-04-18 19:02:24,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-18 19:02:24,891 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:24,895 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:24,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash 890150805, now seen corresponding path program 2 times [2022-04-18 19:02:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:24,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090204902] [2022-04-18 19:02:24,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:24,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:24,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090204902] [2022-04-18 19:02:24,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090204902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:02:24,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111009827] [2022-04-18 19:02:24,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:02:24,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:24,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:02:24,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:02:24,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-18 19:02:25,158 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:02:25,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:02:25,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-18 19:02:25,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:02:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:25,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-18 19:02:25,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111009827] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:25,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-18 19:02:25,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-04-18 19:02:25,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016925311] [2022-04-18 19:02:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:25,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-18 19:02:25,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:25,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-18 19:02:25,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:02:25,203 INFO L87 Difference]: Start difference. First operand 45715 states and 94410 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:25,862 INFO L93 Difference]: Finished difference Result 45307 states and 93580 transitions. [2022-04-18 19:02:25,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-18 19:02:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-04-18 19:02:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:25,983 INFO L225 Difference]: With dead ends: 45307 [2022-04-18 19:02:25,984 INFO L226 Difference]: Without dead ends: 45307 [2022-04-18 19:02:25,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-18 19:02:25,986 INFO L913 BasicCegarLoop]: 461 mSDtfsCounter, 881 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 881 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:25,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [881 Valid, 611 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-18 19:02:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45307 states. [2022-04-18 19:02:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45307 to 45307. [2022-04-18 19:02:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45307 states, 43907 states have (on average 2.131323023663653) internal successors, (93580), 45306 states have internal predecessors, (93580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:26,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45307 states to 45307 states and 93580 transitions. [2022-04-18 19:02:26,946 INFO L78 Accepts]: Start accepts. Automaton has 45307 states and 93580 transitions. Word has length 9 [2022-04-18 19:02:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:26,946 INFO L478 AbstractCegarLoop]: Abstraction has 45307 states and 93580 transitions. [2022-04-18 19:02:26,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 45307 states and 93580 transitions. [2022-04-18 19:02:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-04-18 19:02:26,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:26,947 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:26,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-18 19:02:27,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:27,160 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:27,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1058578409, now seen corresponding path program 1 times [2022-04-18 19:02:27,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:27,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565926563] [2022-04-18 19:02:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:27,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:27,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565926563] [2022-04-18 19:02:27,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565926563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:27,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:27,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 19:02:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085071177] [2022-04-18 19:02:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:27,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:27,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:27,228 INFO L87 Difference]: Start difference. First operand 45307 states and 93580 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:27,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:27,712 INFO L93 Difference]: Finished difference Result 45105 states and 93369 transitions. [2022-04-18 19:02:27,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:27,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-04-18 19:02:27,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:27,973 INFO L225 Difference]: With dead ends: 45105 [2022-04-18 19:02:27,973 INFO L226 Difference]: Without dead ends: 45105 [2022-04-18 19:02:27,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:27,978 INFO L913 BasicCegarLoop]: 311 mSDtfsCounter, 213 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:27,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 622 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 19:02:28,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2022-04-18 19:02:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 45105. [2022-04-18 19:02:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45105 states, 43739 states have (on average 2.1346852923020645) internal successors, (93369), 45104 states have internal predecessors, (93369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:28,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45105 states to 45105 states and 93369 transitions. [2022-04-18 19:02:28,972 INFO L78 Accepts]: Start accepts. Automaton has 45105 states and 93369 transitions. Word has length 10 [2022-04-18 19:02:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:28,973 INFO L478 AbstractCegarLoop]: Abstraction has 45105 states and 93369 transitions. [2022-04-18 19:02:28,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45105 states and 93369 transitions. [2022-04-18 19:02:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-18 19:02:28,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:28,973 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:28,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-18 19:02:28,973 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:28,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1087629599, now seen corresponding path program 1 times [2022-04-18 19:02:28,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:28,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199153064] [2022-04-18 19:02:28,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:28,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:29,082 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:29,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199153064] [2022-04-18 19:02:29,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199153064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:29,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:29,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 19:02:29,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54702285] [2022-04-18 19:02:29,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:29,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 19:02:29,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 19:02:29,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:02:29,084 INFO L87 Difference]: Start difference. First operand 45105 states and 93369 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:31,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:31,221 INFO L93 Difference]: Finished difference Result 46361 states and 95929 transitions. [2022-04-18 19:02:31,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 19:02:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-04-18 19:02:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:31,322 INFO L225 Difference]: With dead ends: 46361 [2022-04-18 19:02:31,322 INFO L226 Difference]: Without dead ends: 46361 [2022-04-18 19:02:31,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:02:31,323 INFO L913 BasicCegarLoop]: 367 mSDtfsCounter, 534 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 2271 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 2271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:31,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 457 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 2271 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-18 19:02:31,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46361 states. [2022-04-18 19:02:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46361 to 45939. [2022-04-18 19:02:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45939 states, 44574 states have (on average 2.132835285143806) internal successors, (95069), 45938 states have internal predecessors, (95069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45939 states to 45939 states and 95069 transitions. [2022-04-18 19:02:32,146 INFO L78 Accepts]: Start accepts. Automaton has 45939 states and 95069 transitions. Word has length 12 [2022-04-18 19:02:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:32,146 INFO L478 AbstractCegarLoop]: Abstraction has 45939 states and 95069 transitions. [2022-04-18 19:02:32,146 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:32,150 INFO L276 IsEmpty]: Start isEmpty. Operand 45939 states and 95069 transitions. [2022-04-18 19:02:32,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-18 19:02:32,151 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:32,151 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:32,151 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-18 19:02:32,151 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1635114620, now seen corresponding path program 1 times [2022-04-18 19:02:32,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:32,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896911485] [2022-04-18 19:02:32,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:32,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:32,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:02:32,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:32,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896911485] [2022-04-18 19:02:32,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896911485] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:32,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:32,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-18 19:02:32,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725982223] [2022-04-18 19:02:32,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:32,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-18 19:02:32,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:32,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-18 19:02:32,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:02:32,226 INFO L87 Difference]: Start difference. First operand 45939 states and 95069 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:34,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:34,214 INFO L93 Difference]: Finished difference Result 47101 states and 97435 transitions. [2022-04-18 19:02:34,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-18 19:02:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-04-18 19:02:34,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:34,316 INFO L225 Difference]: With dead ends: 47101 [2022-04-18 19:02:34,316 INFO L226 Difference]: Without dead ends: 47101 [2022-04-18 19:02:34,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-18 19:02:34,316 INFO L913 BasicCegarLoop]: 367 mSDtfsCounter, 482 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:34,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [482 Valid, 457 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2119 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-18 19:02:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47101 states. [2022-04-18 19:02:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47101 to 46711. [2022-04-18 19:02:35,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46711 states, 45346 states have (on average 2.131191284788074) internal successors, (96641), 46710 states have internal predecessors, (96641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46711 states to 46711 states and 96641 transitions. [2022-04-18 19:02:35,195 INFO L78 Accepts]: Start accepts. Automaton has 46711 states and 96641 transitions. Word has length 13 [2022-04-18 19:02:35,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:35,195 INFO L478 AbstractCegarLoop]: Abstraction has 46711 states and 96641 transitions. [2022-04-18 19:02:35,195 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:35,195 INFO L276 IsEmpty]: Start isEmpty. Operand 46711 states and 96641 transitions. [2022-04-18 19:02:35,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-18 19:02:35,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:35,196 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:35,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-18 19:02:35,196 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -314872471, now seen corresponding path program 1 times [2022-04-18 19:02:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:35,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946200251] [2022-04-18 19:02:35,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:35,244 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:35,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946200251] [2022-04-18 19:02:35,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946200251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:35,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:35,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:35,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145783500] [2022-04-18 19:02:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:35,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:35,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:35,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:35,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:35,246 INFO L87 Difference]: Start difference. First operand 46711 states and 96641 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:36,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:36,326 INFO L93 Difference]: Finished difference Result 46924 states and 97075 transitions. [2022-04-18 19:02:36,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:36,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 15 [2022-04-18 19:02:36,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:36,436 INFO L225 Difference]: With dead ends: 46924 [2022-04-18 19:02:36,437 INFO L226 Difference]: Without dead ends: 46924 [2022-04-18 19:02:36,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:36,437 INFO L913 BasicCegarLoop]: 325 mSDtfsCounter, 132 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:36,437 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 352 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:02:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46924 states. [2022-04-18 19:02:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46924 to 46924. [2022-04-18 19:02:37,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46924 states, 45559 states have (on average 2.1307535283917556) internal successors, (97075), 46923 states have internal predecessors, (97075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46924 states to 46924 states and 97075 transitions. [2022-04-18 19:02:37,346 INFO L78 Accepts]: Start accepts. Automaton has 46924 states and 97075 transitions. Word has length 15 [2022-04-18 19:02:37,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:37,346 INFO L478 AbstractCegarLoop]: Abstraction has 46924 states and 97075 transitions. [2022-04-18 19:02:37,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 46924 states and 97075 transitions. [2022-04-18 19:02:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-18 19:02:37,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:37,347 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:37,347 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-18 19:02:37,347 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:37,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:37,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1822219091, now seen corresponding path program 1 times [2022-04-18 19:02:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:37,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837633508] [2022-04-18 19:02:37,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:37,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:02:37,390 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:37,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837633508] [2022-04-18 19:02:37,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837633508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:37,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:37,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803759239] [2022-04-18 19:02:37,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:37,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:37,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:37,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:37,392 INFO L87 Difference]: Start difference. First operand 46924 states and 97075 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:38,258 INFO L93 Difference]: Finished difference Result 47118 states and 97470 transitions. [2022-04-18 19:02:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:38,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 16 [2022-04-18 19:02:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:38,361 INFO L225 Difference]: With dead ends: 47118 [2022-04-18 19:02:38,362 INFO L226 Difference]: Without dead ends: 47118 [2022-04-18 19:02:38,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:38,362 INFO L913 BasicCegarLoop]: 325 mSDtfsCounter, 120 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:38,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 353 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:02:38,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47118 states. [2022-04-18 19:02:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47118 to 47118. [2022-04-18 19:02:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47118 states, 45754 states have (on average 2.130305547055995) internal successors, (97470), 47117 states have internal predecessors, (97470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47118 states to 47118 states and 97470 transitions. [2022-04-18 19:02:39,376 INFO L78 Accepts]: Start accepts. Automaton has 47118 states and 97470 transitions. Word has length 16 [2022-04-18 19:02:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:39,377 INFO L478 AbstractCegarLoop]: Abstraction has 47118 states and 97470 transitions. [2022-04-18 19:02:39,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 47118 states and 97470 transitions. [2022-04-18 19:02:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:02:39,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:39,378 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:39,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-18 19:02:39,379 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting worker_fnErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 619579110, now seen corresponding path program 1 times [2022-04-18 19:02:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:39,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827561765] [2022-04-18 19:02:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:02:39,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:39,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827561765] [2022-04-18 19:02:39,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827561765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:39,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:39,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-18 19:02:39,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408232107] [2022-04-18 19:02:39,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:39,533 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-18 19:02:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-18 19:02:39,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-18 19:02:39,535 INFO L87 Difference]: Start difference. First operand 47118 states and 97470 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:41,630 INFO L93 Difference]: Finished difference Result 47122 states and 97478 transitions. [2022-04-18 19:02:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-18 19:02:41,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 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 18 [2022-04-18 19:02:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:41,736 INFO L225 Difference]: With dead ends: 47122 [2022-04-18 19:02:41,736 INFO L226 Difference]: Without dead ends: 47122 [2022-04-18 19:02:41,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-18 19:02:41,737 INFO L913 BasicCegarLoop]: 545 mSDtfsCounter, 2235 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2235 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:41,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2235 Valid, 1150 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-18 19:02:41,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47122 states. [2022-04-18 19:02:42,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47122 to 47102. [2022-04-18 19:02:42,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47102 states, 45739 states have (on average 2.1303045541004395) internal successors, (97438), 47101 states have internal predecessors, (97438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47102 states to 47102 states and 97438 transitions. [2022-04-18 19:02:42,631 INFO L78 Accepts]: Start accepts. Automaton has 47102 states and 97438 transitions. Word has length 18 [2022-04-18 19:02:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:42,631 INFO L478 AbstractCegarLoop]: Abstraction has 47102 states and 97438 transitions. [2022-04-18 19:02:42,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 47102 states and 97438 transitions. [2022-04-18 19:02:42,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:02:42,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:42,632 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:42,632 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-18 19:02:42,632 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting worker_fnErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:42,633 INFO L85 PathProgramCache]: Analyzing trace with hash -133839887, now seen corresponding path program 1 times [2022-04-18 19:02:42,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:42,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485266820] [2022-04-18 19:02:42,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:42,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:42,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485266820] [2022-04-18 19:02:42,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485266820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:42,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:42,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347888310] [2022-04-18 19:02:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:42,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:42,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:42,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:42,685 INFO L87 Difference]: Start difference. First operand 47102 states and 97438 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:43,560 INFO L93 Difference]: Finished difference Result 48137 states and 99548 transitions. [2022-04-18 19:02:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 18 [2022-04-18 19:02:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:43,664 INFO L225 Difference]: With dead ends: 48137 [2022-04-18 19:02:43,664 INFO L226 Difference]: Without dead ends: 48137 [2022-04-18 19:02:43,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:43,665 INFO L913 BasicCegarLoop]: 323 mSDtfsCounter, 135 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:43,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 350 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:02:43,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48137 states. [2022-04-18 19:02:44,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48137 to 47295. [2022-04-18 19:02:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47295 states, 45934 states have (on average 2.1298384638829626) internal successors, (97832), 47294 states have internal predecessors, (97832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47295 states to 47295 states and 97832 transitions. [2022-04-18 19:02:44,610 INFO L78 Accepts]: Start accepts. Automaton has 47295 states and 97832 transitions. Word has length 18 [2022-04-18 19:02:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:44,610 INFO L478 AbstractCegarLoop]: Abstraction has 47295 states and 97832 transitions. [2022-04-18 19:02:44,610 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 47295 states and 97832 transitions. [2022-04-18 19:02:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-18 19:02:44,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:44,611 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:44,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-18 19:02:44,611 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:44,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1012307395, now seen corresponding path program 1 times [2022-04-18 19:02:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:44,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958130280] [2022-04-18 19:02:44,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:44,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:44,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958130280] [2022-04-18 19:02:44,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958130280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:02:44,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146593276] [2022-04-18 19:02:44,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:44,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:44,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:02:44,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:02:44,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-18 19:02:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:44,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-18 19:02:44,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:02:44,915 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:02:44,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-04-18 19:02:45,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:02:45,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-04-18 19:02:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:45,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:02:45,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select (select (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| v_ArrVal_1300) |c_~#pre~0.base|) (+ |c_~#pre~0.offset| |c_ULTIMATE.start_worker_fn_~tid~0#1|)) |c_ULTIMATE.start_worker_fn_#t~nondet18#1|)) is different from false [2022-04-18 19:02:45,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-04-18 19:02:45,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2022-04-18 19:02:45,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2022-04-18 19:02:45,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:45,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146593276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:02:45,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1964278612] [2022-04-18 19:02:45,117 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:02:45,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:02:45,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-04-18 19:02:45,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033721650] [2022-04-18 19:02:45,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:02:45,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-18 19:02:45,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:45,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-18 19:02:45,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=144, Unknown=1, NotChecked=24, Total=210 [2022-04-18 19:02:45,120 INFO L87 Difference]: Start difference. First operand 47295 states and 97832 transitions. Second operand has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:47,943 INFO L93 Difference]: Finished difference Result 47299 states and 97840 transitions. [2022-04-18 19:02:47,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 19:02:47,944 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 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 18 [2022-04-18 19:02:47,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:48,049 INFO L225 Difference]: With dead ends: 47299 [2022-04-18 19:02:48,050 INFO L226 Difference]: Without dead ends: 47299 [2022-04-18 19:02:48,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=249, Unknown=1, NotChecked=34, Total=380 [2022-04-18 19:02:48,050 INFO L913 BasicCegarLoop]: 451 mSDtfsCounter, 2962 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 3466 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2962 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 4578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 3466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1090 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:48,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2962 Valid, 1294 Invalid, 4578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 3466 Invalid, 0 Unknown, 1090 Unchecked, 2.5s Time] [2022-04-18 19:02:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47299 states. [2022-04-18 19:02:48,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47299 to 47279. [2022-04-18 19:02:48,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47279 states, 45919 states have (on average 2.129837322241338) internal successors, (97800), 47278 states have internal predecessors, (97800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47279 states to 47279 states and 97800 transitions. [2022-04-18 19:02:49,034 INFO L78 Accepts]: Start accepts. Automaton has 47279 states and 97800 transitions. Word has length 18 [2022-04-18 19:02:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:49,034 INFO L478 AbstractCegarLoop]: Abstraction has 47279 states and 97800 transitions. [2022-04-18 19:02:49,034 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 14 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 47279 states and 97800 transitions. [2022-04-18 19:02:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-18 19:02:49,035 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:49,035 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:49,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-18 19:02:49,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-18 19:02:49,236 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1667001366, now seen corresponding path program 1 times [2022-04-18 19:02:49,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:49,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710128401] [2022-04-18 19:02:49,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:49,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:02:49,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:49,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710128401] [2022-04-18 19:02:49,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710128401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:49,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732795769] [2022-04-18 19:02:49,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:49,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:49,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:49,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:49,279 INFO L87 Difference]: Start difference. First operand 47279 states and 97800 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:50,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:50,137 INFO L93 Difference]: Finished difference Result 48228 states and 99733 transitions. [2022-04-18 19:02:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:50,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-04-18 19:02:50,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:50,238 INFO L225 Difference]: With dead ends: 48228 [2022-04-18 19:02:50,239 INFO L226 Difference]: Without dead ends: 48228 [2022-04-18 19:02:50,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:50,239 INFO L913 BasicCegarLoop]: 321 mSDtfsCounter, 123 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:50,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 348 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:02:50,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2022-04-18 19:02:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 47454. [2022-04-18 19:02:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47454 states, 46097 states have (on average 2.1293576588498166) internal successors, (98157), 47453 states have internal predecessors, (98157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47454 states to 47454 states and 98157 transitions. [2022-04-18 19:02:51,201 INFO L78 Accepts]: Start accepts. Automaton has 47454 states and 98157 transitions. Word has length 19 [2022-04-18 19:02:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:51,201 INFO L478 AbstractCegarLoop]: Abstraction has 47454 states and 98157 transitions. [2022-04-18 19:02:51,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 47454 states and 98157 transitions. [2022-04-18 19:02:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:02:51,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:51,202 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:51,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-18 19:02:51,202 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:51,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:51,202 INFO L85 PathProgramCache]: Analyzing trace with hash 239731322, now seen corresponding path program 1 times [2022-04-18 19:02:51,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:51,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848085790] [2022-04-18 19:02:51,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-18 19:02:51,363 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:51,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848085790] [2022-04-18 19:02:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848085790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:51,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-18 19:02:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957933133] [2022-04-18 19:02:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:51,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-18 19:02:51,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:51,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-18 19:02:51,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-04-18 19:02:51,364 INFO L87 Difference]: Start difference. First operand 47454 states and 98157 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:54,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:54,366 INFO L93 Difference]: Finished difference Result 53860 states and 111375 transitions. [2022-04-18 19:02:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-18 19:02:54,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:02:54,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:54,491 INFO L225 Difference]: With dead ends: 53860 [2022-04-18 19:02:54,491 INFO L226 Difference]: Without dead ends: 53860 [2022-04-18 19:02:54,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2022-04-18 19:02:54,492 INFO L913 BasicCegarLoop]: 457 mSDtfsCounter, 1841 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 3717 mSolverCounterSat, 527 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1841 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 4244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 527 IncrementalHoareTripleChecker+Valid, 3717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:54,492 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1841 Valid, 1064 Invalid, 4244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [527 Valid, 3717 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-18 19:02:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53860 states. [2022-04-18 19:02:55,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53860 to 47264. [2022-04-18 19:02:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47264 states, 45912 states have (on average 2.129552186792124) internal successors, (97772), 47263 states have internal predecessors, (97772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:55,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47264 states to 47264 states and 97772 transitions. [2022-04-18 19:02:55,508 INFO L78 Accepts]: Start accepts. Automaton has 47264 states and 97772 transitions. Word has length 21 [2022-04-18 19:02:55,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:55,509 INFO L478 AbstractCegarLoop]: Abstraction has 47264 states and 97772 transitions. [2022-04-18 19:02:55,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:55,509 INFO L276 IsEmpty]: Start isEmpty. Operand 47264 states and 97772 transitions. [2022-04-18 19:02:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:02:55,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:55,510 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:55,510 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-18 19:02:55,510 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting worker_fnErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:55,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:55,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1477008588, now seen corresponding path program 1 times [2022-04-18 19:02:55,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:55,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229481379] [2022-04-18 19:02:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:55,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:55,580 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:55,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229481379] [2022-04-18 19:02:55,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229481379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:55,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:55,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-18 19:02:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979072327] [2022-04-18 19:02:55,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:55,581 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:55,582 INFO L87 Difference]: Start difference. First operand 47264 states and 97772 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:56,476 INFO L93 Difference]: Finished difference Result 47459 states and 98170 transitions. [2022-04-18 19:02:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:56,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:02:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:56,578 INFO L225 Difference]: With dead ends: 47459 [2022-04-18 19:02:56,578 INFO L226 Difference]: Without dead ends: 47459 [2022-04-18 19:02:56,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:56,580 INFO L913 BasicCegarLoop]: 324 mSDtfsCounter, 131 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:56,580 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 350 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-18 19:02:56,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47459 states. [2022-04-18 19:02:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47459 to 47459. [2022-04-18 19:02:57,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47459 states, 46109 states have (on average 2.1290854280075475) internal successors, (98170), 47458 states have internal predecessors, (98170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47459 states to 47459 states and 98170 transitions. [2022-04-18 19:02:57,556 INFO L78 Accepts]: Start accepts. Automaton has 47459 states and 98170 transitions. Word has length 21 [2022-04-18 19:02:57,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:57,557 INFO L478 AbstractCegarLoop]: Abstraction has 47459 states and 98170 transitions. [2022-04-18 19:02:57,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 47459 states and 98170 transitions. [2022-04-18 19:02:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:02:57,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:57,558 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:57,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-18 19:02:57,558 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting worker_fnErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:57,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:57,558 INFO L85 PathProgramCache]: Analyzing trace with hash -491871161, now seen corresponding path program 1 times [2022-04-18 19:02:57,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:57,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79479250] [2022-04-18 19:02:57,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:57,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:57,605 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:57,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79479250] [2022-04-18 19:02:57,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79479250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-18 19:02:57,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-18 19:02:57,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-18 19:02:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531890063] [2022-04-18 19:02:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-18 19:02:57,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-18 19:02:57,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:02:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-18 19:02:57,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:57,608 INFO L87 Difference]: Start difference. First operand 47459 states and 98170 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:02:58,142 INFO L93 Difference]: Finished difference Result 49625 states and 102582 transitions. [2022-04-18 19:02:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-18 19:02:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:02:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:02:58,257 INFO L225 Difference]: With dead ends: 49625 [2022-04-18 19:02:58,257 INFO L226 Difference]: Without dead ends: 49625 [2022-04-18 19:02:58,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-18 19:02:58,258 INFO L913 BasicCegarLoop]: 467 mSDtfsCounter, 235 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-18 19:02:58,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 774 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-18 19:02:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49625 states. [2022-04-18 19:02:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49625 to 47681. [2022-04-18 19:02:59,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47681 states, 46331 states have (on average 2.128639571776996) internal successors, (98622), 47680 states have internal predecessors, (98622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47681 states to 47681 states and 98622 transitions. [2022-04-18 19:02:59,303 INFO L78 Accepts]: Start accepts. Automaton has 47681 states and 98622 transitions. Word has length 21 [2022-04-18 19:02:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:02:59,304 INFO L478 AbstractCegarLoop]: Abstraction has 47681 states and 98622 transitions. [2022-04-18 19:02:59,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:02:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 47681 states and 98622 transitions. [2022-04-18 19:02:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:02:59,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:02:59,305 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:02:59,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-18 19:02:59,305 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:02:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:02:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash 702477174, now seen corresponding path program 1 times [2022-04-18 19:02:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:02:59,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283056488] [2022-04-18 19:02:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:02:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:02:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:02:59,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:02:59,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283056488] [2022-04-18 19:02:59,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283056488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:02:59,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26876250] [2022-04-18 19:02:59,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:02:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:02:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:02:59,856 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:02:59,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-18 19:03:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:03:00,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-18 19:03:00,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:03:00,063 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:03:00,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-04-18 19:03:00,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:03:00,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:03:00,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:03:00,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:03:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:03:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:03:00,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:03:00,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:03:00,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:03:00,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-04-18 19:03:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:03:00,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:03:00,900 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1987 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:00,940 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:00,966 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1985 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:00,989 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:01,022 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_1980) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_1980) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_1980) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_1980) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_1982) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_1983) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:01,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:03:01,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:03:03,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse1 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse1 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5)) 0))))) is different from false [2022-04-18 19:03:16,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,785 INFO L356 Elim1Store]: treesize reduction 1188, result has 17.6 percent of original size [2022-04-18 19:03:16,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 265 [2022-04-18 19:03:16,802 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-04-18 19:03:16,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 208 [2022-04-18 19:03:16,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 19:03:16,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,959 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:16,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,022 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:03:17,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:03:17,029 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,173 INFO L356 Elim1Store]: treesize reduction 870, result has 7.5 percent of original size [2022-04-18 19:03:17,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 83 [2022-04-18 19:03:17,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,179 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-04-18 19:03:17,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,206 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,210 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,211 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,212 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,339 INFO L356 Elim1Store]: treesize reduction 860, result has 8.6 percent of original size [2022-04-18 19:03:17,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 93 [2022-04-18 19:03:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,360 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,361 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:03:17,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-04-18 19:03:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-04-18 19:03:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26876250] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:03:17,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1601156479] [2022-04-18 19:03:17,598 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:03:17,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:03:17,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 34 [2022-04-18 19:03:17,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189976371] [2022-04-18 19:03:17,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:03:17,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-18 19:03:17,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:03:17,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-18 19:03:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=572, Unknown=20, NotChecked=472, Total=1260 [2022-04-18 19:03:17,600 INFO L87 Difference]: Start difference. First operand 47681 states and 98622 transitions. Second operand has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:03:45,098 WARN L232 SmtUtils]: Spent 10.05s on a formula simplification. DAG size of input: 74 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-18 19:03:47,210 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse6 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse0) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse0) (= (select .cse6 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse6 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:49,281 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse6 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0))))) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0))) is different from false [2022-04-18 19:03:51,303 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= (select .cse0 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:53,392 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985))) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse5 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse5 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (= (select .cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:03:55,420 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= (select .cse0 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_1987 (Array Int Int)) (v_ArrVal_1980 Int) (v_ArrVal_1983 Int) (v_ArrVal_1982 Int) (v_ArrVal_1985 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 8) v_ArrVal_1980) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 9) v_ArrVal_1982) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 10) v_ArrVal_1983) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2825| 11) v_ArrVal_1985)) |c_~#pre~0.base| v_ArrVal_1987) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:01,783 INFO L93 Difference]: Finished difference Result 49311 states and 101969 transitions. [2022-04-18 19:04:01,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-18 19:04:01,783 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 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-04-18 19:04:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:01,896 INFO L225 Difference]: With dead ends: 49311 [2022-04-18 19:04:01,897 INFO L226 Difference]: Without dead ends: 49311 [2022-04-18 19:04:01,897 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 52.0s TimeCoverageRelationStatistics Valid=326, Invalid=952, Unknown=34, NotChecked=1040, Total=2352 [2022-04-18 19:04:01,898 INFO L913 BasicCegarLoop]: 475 mSDtfsCounter, 1398 mSDsluCounter, 5083 mSDsCounter, 0 mSdLazyCounter, 9370 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 17719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 9370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8143 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:01,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 3191 Invalid, 17719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 9370 Invalid, 0 Unknown, 8143 Unchecked, 7.2s Time] [2022-04-18 19:04:01,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49311 states. [2022-04-18 19:04:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49311 to 47706. [2022-04-18 19:04:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47706 states, 46356 states have (on average 2.1285701958753993) internal successors, (98672), 47705 states have internal predecessors, (98672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47706 states to 47706 states and 98672 transitions. [2022-04-18 19:04:02,714 INFO L78 Accepts]: Start accepts. Automaton has 47706 states and 98672 transitions. Word has length 21 [2022-04-18 19:04:02,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:02,714 INFO L478 AbstractCegarLoop]: Abstraction has 47706 states and 98672 transitions. [2022-04-18 19:04:02,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:02,714 INFO L276 IsEmpty]: Start isEmpty. Operand 47706 states and 98672 transitions. [2022-04-18 19:04:02,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:04:02,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:02,715 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:02,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:02,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-18 19:04:02,916 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:04:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -888478872, now seen corresponding path program 2 times [2022-04-18 19:04:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:02,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535154212] [2022-04-18 19:04:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:02,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:03,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:03,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535154212] [2022-04-18 19:04:03,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535154212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851130740] [2022-04-18 19:04:03,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:04:03,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:03,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:03,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:03,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-18 19:04:03,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:04:03,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:04:03,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-18 19:04:03,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:03,955 INFO L356 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2022-04-18 19:04:03,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 25 treesize of output 33 [2022-04-18 19:04:04,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:04:04,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:04:04,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:04:04,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:04:04,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:04,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:04,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:04,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:04,705 INFO L356 Elim1Store]: treesize reduction 208, result has 15.1 percent of original size [2022-04-18 19:04:04,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 54 treesize of output 62 [2022-04-18 19:04:04,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-04-18 19:04:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:04,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:04:04,984 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2232 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,023 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int))) (= 0 (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,055 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,079 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,114 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231)) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,158 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2224) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2226) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2229) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:05,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:04:19,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,665 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:19,940 INFO L356 Elim1Store]: treesize reduction 1188, result has 17.6 percent of original size [2022-04-18 19:04:19,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 265 [2022-04-18 19:04:19,949 INFO L356 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2022-04-18 19:04:19,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 238 treesize of output 208 [2022-04-18 19:04:19,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 19:04:20,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,210 INFO L356 Elim1Store]: treesize reduction 860, result has 8.6 percent of original size [2022-04-18 19:04:20,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 93 [2022-04-18 19:04:20,213 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-04-18 19:04:20,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,227 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,229 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,297 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:04:20,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:04:20,303 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,304 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,309 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:04:20,372 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:04:20,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:04:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-04-18 19:04:20,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851130740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:04:20,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [527169192] [2022-04-18 19:04:20,714 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:04:20,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:04:20,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 36 [2022-04-18 19:04:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819519008] [2022-04-18 19:04:20,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:04:20,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-18 19:04:20,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:04:20,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-18 19:04:20,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=753, Unknown=31, NotChecked=448, Total=1406 [2022-04-18 19:04:20,715 INFO L87 Difference]: Start difference. First operand 47706 states and 98672 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:24,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|)) (.cse1 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse0) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 2)) (< 1 |c_ULTIMATE.start_main_~#a~1#1.base|) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_ULTIMATE.start_main_~i~5#1| 0) (= (select .cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse0) (= (select .cse1 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse1 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (let ((.cse5 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse6 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse6 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse6 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))))) is different from false [2022-04-18 19:04:26,855 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 2)) (< 1 |c_ULTIMATE.start_main_~#a~1#1.base|) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))))) is different from false [2022-04-18 19:04:28,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 2)) (< 1 |c_ULTIMATE.start_main_~#a~1#1.base|) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2231 Int) (v_ArrVal_2224 Int) (v_ArrVal_2232 (Array Int Int)) (v_ArrVal_2226 Int) (v_ArrVal_2229 Int)) (= (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 8) v_ArrVal_2224) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 9) v_ArrVal_2226) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 10) v_ArrVal_2229) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2826| 11) v_ArrVal_2231))) |c_~#pre~0.base| v_ArrVal_2232) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))))) is different from false [2022-04-18 19:04:43,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:04:43,712 INFO L93 Difference]: Finished difference Result 92492 states and 191633 transitions. [2022-04-18 19:04:43,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-18 19:04:43,712 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 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-04-18 19:04:43,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:04:44,015 INFO L225 Difference]: With dead ends: 92492 [2022-04-18 19:04:44,015 INFO L226 Difference]: Without dead ends: 92492 [2022-04-18 19:04:44,015 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=324, Invalid=1241, Unknown=35, NotChecked=850, Total=2450 [2022-04-18 19:04:44,016 INFO L913 BasicCegarLoop]: 624 mSDtfsCounter, 2159 mSDsluCounter, 9665 mSDsCounter, 0 mSdLazyCounter, 21874 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 5478 SdHoareTripleChecker+Invalid, 39151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 21874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16323 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:04:44,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2159 Valid, 5478 Invalid, 39151 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [954 Valid, 21874 Invalid, 0 Unknown, 16323 Unchecked, 15.7s Time] [2022-04-18 19:04:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92492 states. [2022-04-18 19:04:44,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92492 to 47705. [2022-04-18 19:04:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47705 states, 46355 states have (on average 2.128572969474706) internal successors, (98670), 47704 states have internal predecessors, (98670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47705 states to 47705 states and 98670 transitions. [2022-04-18 19:04:45,234 INFO L78 Accepts]: Start accepts. Automaton has 47705 states and 98670 transitions. Word has length 21 [2022-04-18 19:04:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:04:45,234 INFO L478 AbstractCegarLoop]: Abstraction has 47705 states and 98670 transitions. [2022-04-18 19:04:45,234 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:04:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 47705 states and 98670 transitions. [2022-04-18 19:04:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:04:45,235 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:04:45,235 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:04:45,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-18 19:04:45,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,6 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:45,440 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:04:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:04:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1509337882, now seen corresponding path program 3 times [2022-04-18 19:04:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:04:45,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400884440] [2022-04-18 19:04:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:04:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:04:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:04:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:46,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:04:46,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400884440] [2022-04-18 19:04:46,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400884440] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:04:46,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234455707] [2022-04-18 19:04:46,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-18 19:04:46,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:04:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:04:46,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:04:46,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-18 19:04:46,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-18 19:04:46,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:04:46,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-18 19:04:46,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:04:46,400 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:04:46,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-04-18 19:04:46,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:04:46,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:04:46,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:04:46,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:04:46,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:46,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:46,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:04:46,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:04:52,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-04-18 19:04:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:04:57,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:04:57,645 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2477 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2477 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2477 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2477 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:58,264 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2472) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2474) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2472) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2474) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2472) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2474) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2472) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2474) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:04:58,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:05:11,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse1 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse6 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0))))) is different from false [2022-04-18 19:05:11,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:11,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:11,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:11,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:11,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:11,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,084 INFO L356 Elim1Store]: treesize reduction 1230, result has 14.6 percent of original size [2022-04-18 19:05:12,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 223 [2022-04-18 19:05:12,097 INFO L356 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2022-04-18 19:05:12,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-04-18 19:05:12,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 19:05:12,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,186 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,187 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,331 INFO L356 Elim1Store]: treesize reduction 870, result has 7.5 percent of original size [2022-04-18 19:05:12,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 83 [2022-04-18 19:05:12,334 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2022-04-18 19:05:12,346 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,347 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,349 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,351 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,352 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,418 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:05:12,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:05:12,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,429 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,439 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:12,490 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:05:12,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:05:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-04-18 19:05:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234455707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:05:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1067267845] [2022-04-18 19:05:12,735 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:05:12,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:05:12,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 34 [2022-04-18 19:05:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295139831] [2022-04-18 19:05:12,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:05:12,735 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-18 19:05:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-18 19:05:12,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=781, Unknown=49, NotChecked=252, Total=1260 [2022-04-18 19:05:12,736 INFO L87 Difference]: Start difference. First operand 47705 states and 98670 transitions. Second operand has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:15,328 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_ULTIMATE.start_main_~i~5#1| 12) |c_ULTIMATE.start_main_~#a~1#1.offset|))) (and (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| .cse0) (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse2 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse2 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse5 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse5)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse7 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse6 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse7 0)))) (store .cse6 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse6 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse7)) 0))))) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (<= |c_worker_fnThread1of1ForFork0_#in~arg#1.offset| .cse0) (= (select (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3))) is different from false [2022-04-18 19:05:17,385 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_worker_fnThread1of1ForFork0_#in~arg#1.base| |c_ULTIMATE.start_main_~#a~1#1.base|) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse1 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse1 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse1)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse4 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse3 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse6 0)))) (store .cse5 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select .cse5 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475))) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0))))) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (<= (div (+ (* (- 1) |c_worker_fnThread1of1ForFork0_#in~arg#1.offset|) |c_ULTIMATE.start_main_~#a~1#1.offset|) (- 12)) 0)) is different from false [2022-04-18 19:05:19,418 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= (select .cse0 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_ULTIMATE.start_main_~i~5#1| 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))))) is different from false [2022-04-18 19:05:21,452 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|))) (and (= (select .cse0 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (<= |c_worker_fnThread1of1ForFork0_~a~0#1.offset| |c_ULTIMATE.start_main_~#a~1#1.offset|) (not (= |c_ULTIMATE.start_main_~#a~1#1.base| 3)) (= |c_ULTIMATE.start_main_~#a~1#1.base| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (= (select .cse0 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= (select .cse0 (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (= |c_~#pre~0.base| 3) (= (select .cse0 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0) (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2472 Int) (v_ArrVal_2474 Int) (v_ArrVal_2475 Int) (v_ArrVal_2477 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 8) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 9) v_ArrVal_2472) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 10) v_ArrVal_2474) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2827| 11) v_ArrVal_2475)) |c_~#pre~0.base| v_ArrVal_2477) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))))) is different from false [2022-04-18 19:05:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:05:25,172 INFO L93 Difference]: Finished difference Result 49949 states and 103233 transitions. [2022-04-18 19:05:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-18 19:05:25,173 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-04-18 19:05:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:05:25,281 INFO L225 Difference]: With dead ends: 49949 [2022-04-18 19:05:25,281 INFO L226 Difference]: Without dead ends: 49949 [2022-04-18 19:05:25,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=216, Invalid=952, Unknown=54, NotChecked=584, Total=1806 [2022-04-18 19:05:25,282 INFO L913 BasicCegarLoop]: 498 mSDtfsCounter, 2040 mSDsluCounter, 5554 mSDsCounter, 0 mSdLazyCounter, 5569 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 13174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 5569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7470 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-18 19:05:25,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2040 Valid, 3925 Invalid, 13174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 5569 Invalid, 0 Unknown, 7470 Unchecked, 3.7s Time] [2022-04-18 19:05:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49949 states. [2022-04-18 19:05:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49949 to 47713. [2022-04-18 19:05:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47713 states, 46363 states have (on average 2.1285507840303692) internal successors, (98686), 47712 states have internal predecessors, (98686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47713 states to 47713 states and 98686 transitions. [2022-04-18 19:05:26,107 INFO L78 Accepts]: Start accepts. Automaton has 47713 states and 98686 transitions. Word has length 21 [2022-04-18 19:05:26,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:05:26,107 INFO L478 AbstractCegarLoop]: Abstraction has 47713 states and 98686 transitions. [2022-04-18 19:05:26,107 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:05:26,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47713 states and 98686 transitions. [2022-04-18 19:05:26,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:05:26,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:05:26,108 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:05:26,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-18 19:05:26,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:26,309 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:05:26,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:05:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 468814056, now seen corresponding path program 4 times [2022-04-18 19:05:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:05:26,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643148639] [2022-04-18 19:05:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:05:26,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:05:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:26,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:05:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643148639] [2022-04-18 19:05:26,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643148639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:05:26,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007209598] [2022-04-18 19:05:26,930 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-18 19:05:26,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:05:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:05:26,932 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:05:26,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-18 19:05:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:05:27,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-18 19:05:27,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:05:27,172 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-04-18 19:05:27,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 15 [2022-04-18 19:05:27,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:05:27,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:05:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:05:27,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:05:27,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:05:27,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:05:27,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:05:27,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:27,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:05:31,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2022-04-18 19:05:35,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:35,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:05:35,880 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2722 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:05:36,393 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720)) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720)) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720)) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720)) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:05:36,453 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720))) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720))) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (let ((.cse3 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720))) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_2716 Int) (v_ArrVal_2718 Int) (v_ArrVal_2722 (Array Int Int)) (v_ArrVal_2720 Int)) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (store (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2716) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) v_ArrVal_2718) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) v_ArrVal_2720))) |c_~#pre~0.base| v_ArrVal_2722) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:05:41,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,508 INFO L356 Elim1Store]: treesize reduction 1230, result has 14.6 percent of original size [2022-04-18 19:05:41,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 223 [2022-04-18 19:05:41,518 INFO L356 Elim1Store]: treesize reduction 132, result has 0.8 percent of original size [2022-04-18 19:05:41,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 206 treesize of output 170 [2022-04-18 19:05:41,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 19:05:41,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,787 INFO L356 Elim1Store]: treesize reduction 792, result has 15.8 percent of original size [2022-04-18 19:05:41,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 161 [2022-04-18 19:05:41,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:05:41,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,808 INFO L356 Elim1Store]: treesize reduction 27, result has 27.0 percent of original size [2022-04-18 19:05:41,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 74 [2022-04-18 19:05:41,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,867 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,930 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:05:41,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:05:41,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,936 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,937 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:41,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:05:42,004 INFO L356 Elim1Store]: treesize reduction 940, result has 0.1 percent of original size [2022-04-18 19:05:42,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 87 treesize of output 1 [2022-04-18 19:05:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:05:42,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007209598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-18 19:05:42,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385570419] [2022-04-18 19:05:42,369 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) 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:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:172) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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-04-18 19:05:42,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-18 19:05:42,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 35 [2022-04-18 19:05:42,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575482871] [2022-04-18 19:05:42,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-18 19:05:42,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-18 19:05:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-04-18 19:05:42,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-18 19:05:42,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=908, Unknown=56, NotChecked=198, Total=1332 [2022-04-18 19:05:42,371 INFO L87 Difference]: Start difference. First operand 47713 states and 98686 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-18 19:06:27,390 INFO L93 Difference]: Finished difference Result 57081 states and 118025 transitions. [2022-04-18 19:06:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-18 19:06:27,391 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 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-04-18 19:06:27,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-18 19:06:27,519 INFO L225 Difference]: With dead ends: 57081 [2022-04-18 19:06:27,519 INFO L226 Difference]: Without dead ends: 57081 [2022-04-18 19:06:27,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 24 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 53.8s TimeCoverageRelationStatistics Valid=475, Invalid=1721, Unknown=72, NotChecked=282, Total=2550 [2022-04-18 19:06:27,520 INFO L913 BasicCegarLoop]: 447 mSDtfsCounter, 2621 mSDsluCounter, 5555 mSDsCounter, 0 mSdLazyCounter, 4954 mSolverCounterSat, 633 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2621 SdHoareTripleChecker+Valid, 3405 SdHoareTripleChecker+Invalid, 18025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 633 IncrementalHoareTripleChecker+Valid, 4954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12438 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-18 19:06:27,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2621 Valid, 3405 Invalid, 18025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [633 Valid, 4954 Invalid, 0 Unknown, 12438 Unchecked, 4.4s Time] [2022-04-18 19:06:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57081 states. [2022-04-18 19:06:28,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57081 to 47727. [2022-04-18 19:06:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47727 states, 46377 states have (on average 2.1285335403324925) internal successors, (98715), 47726 states have internal predecessors, (98715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47727 states to 47727 states and 98715 transitions. [2022-04-18 19:06:28,502 INFO L78 Accepts]: Start accepts. Automaton has 47727 states and 98715 transitions. Word has length 21 [2022-04-18 19:06:28,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-18 19:06:28,502 INFO L478 AbstractCegarLoop]: Abstraction has 47727 states and 98715 transitions. [2022-04-18 19:06:28,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-18 19:06:28,503 INFO L276 IsEmpty]: Start isEmpty. Operand 47727 states and 98715 transitions. [2022-04-18 19:06:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-18 19:06:28,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-18 19:06:28,503 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-18 19:06:28,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-18 19:06:28,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:06:28,704 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting worker_fnErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 108 more)] === [2022-04-18 19:06:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-18 19:06:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1127991250, now seen corresponding path program 5 times [2022-04-18 19:06:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-04-18 19:06:28,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580885565] [2022-04-18 19:06:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-18 19:06:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-18 19:06:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-18 19:06:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:29,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-04-18 19:06:29,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580885565] [2022-04-18 19:06:29,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580885565] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-18 19:06:29,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420778481] [2022-04-18 19:06:29,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-18 19:06:29,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-18 19:06:29,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 [2022-04-18 19:06:29,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-18 19:06:29,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-18 19:06:29,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-18 19:06:29,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-18 19:06:29,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-18 19:06:29,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-18 19:06:29,906 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-04-18 19:06:29,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 22 [2022-04-18 19:06:30,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-04-18 19:06:30,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-04-18 19:06:30,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-04-18 19:06:30,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:06:30,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:06:30,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-04-18 19:06:30,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:06:30,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-04-18 19:06:30,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-04-18 19:06:36,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 61 [2022-04-18 19:06:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-18 19:06:42,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-18 19:06:42,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store |c_#race| |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:42,916 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0)) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:42,940 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= 0 (let ((.cse2 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse1 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2 0)))) (store .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse1 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse2)))) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:42,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:43,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse0 (let ((.cse1 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse4 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse2 (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse3 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4 0))))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse4)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse5 (let ((.cse6 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse6 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse7 (let ((.cse8 (store |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960)))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))) is different from false [2022-04-18 19:06:43,129 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse3 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0)))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= 0 (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)))) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse12 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse10 (let ((.cse11 (let ((.cse13 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse13 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse11 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12 0))))) (store .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse10 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse12)) 0))) is different from false [2022-04-18 19:06:43,289 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse2 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse6 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse4 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse3 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse10 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse7 (let ((.cse8 (let ((.cse9 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse10 0)))) (store .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse9 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse8 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse7 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse10)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse13 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse11 (let ((.cse12 (let ((.cse14 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse14 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse14 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 8) v_ArrVal_2958) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 9) v_ArrVal_2960))))) (store .cse12 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse12 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse13 0))))) (store .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base| (store (store (select .cse11 |c_ULTIMATE.start_worker_fn_~a~0#1.base|) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 10) 0) (+ |c_ULTIMATE.start_worker_fn_~a~0#1.offset| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse13)) 0))) is different from false [2022-04-18 19:06:45,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| Int)) (or (< |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| (+ 12 |c_ULTIMATE.start_main_~#a~1#1.offset|)) (and (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse3 (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse2 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse2 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 8) v_ArrVal_2958) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 9) v_ArrVal_2960))))) (store .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse1 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse0 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse3)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse6 (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse4 (let ((.cse5 (let ((.cse7 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse7 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse7 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 8) v_ArrVal_2958) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 9) v_ArrVal_2960))))) (store .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse5 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6 0))))) (store .cse4 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse6)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (let ((.cse11 (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|))) (select (select (store (let ((.cse8 (let ((.cse9 (let ((.cse10 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) .cse11 0)))) (store .cse10 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse10 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 8) v_ArrVal_2958) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 9) v_ArrVal_2960))))) (store .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse9 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse8 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse8 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) .cse11)) 0)) (forall ((v_ArrVal_2958 Int) (v_ArrVal_2967 (Array Int Int)) (v_ArrVal_2960 Int)) (= (select (select (store (let ((.cse12 (let ((.cse13 (let ((.cse14 (store |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (store (select |c_#race| |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 9 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0) (+ 10 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0)))) (store .cse14 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse14 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 8) v_ArrVal_2958) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 9) v_ArrVal_2960))))) (store .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base| (store (select .cse13 |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 11 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|) 0))))) (store .cse12 |c_ULTIMATE.start_main_~#a~1#1.base| (store (store (select .cse12 |c_ULTIMATE.start_main_~#a~1#1.base|) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 10) 0) (+ |v_ULTIMATE.start_worker_fn_~a~0#1.offset_2829| 11) 0))) |c_~#pre~0.base| v_ArrVal_2967) |c_worker_fnThread1of1ForFork0_~a~0#1.base|) (+ 8 |c_worker_fnThread1of1ForFork0_~a~0#1.offset|)) 0))))) is different from false [2022-04-18 19:06:45,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:45,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:45,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:45,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:45,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:45,993 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,235 INFO L356 Elim1Store]: treesize reduction 1178, result has 12.6 percent of original size [2022-04-18 19:06:46,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 267 treesize of output 182 [2022-04-18 19:06:46,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,239 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,334 INFO L356 Elim1Store]: treesize reduction 212, result has 32.3 percent of original size [2022-04-18 19:06:46,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 195 treesize of output 241 [2022-04-18 19:06:46,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-04-18 19:06:46,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,525 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,589 INFO L356 Elim1Store]: treesize reduction 877, result has 0.1 percent of original size [2022-04-18 19:06:46,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 267 treesize of output 1 [2022-04-18 19:06:46,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,652 INFO L356 Elim1Store]: treesize reduction 877, result has 0.1 percent of original size [2022-04-18 19:06:46,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 267 treesize of output 1 [2022-04-18 19:06:46,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,660 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-04-18 19:06:46,662 INFO L173 IndexEqualityManager]: detected equality via solver