./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI --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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 01:52:09,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:52:09,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:52:09,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:52:09,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:52:09,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:52:09,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:52:09,857 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:52:09,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:52:09,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:52:09,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:52:09,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:52:09,869 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:52:09,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:52:09,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:52:09,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:52:09,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:52:09,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:52:09,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:52:09,887 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:52:09,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:52:09,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:52:09,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:52:09,899 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:52:09,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:52:09,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:52:09,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:52:09,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:52:09,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:52:09,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:52:09,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:52:09,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:52:09,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:52:09,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:52:09,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:52:09,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:52:09,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:52:09,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:52:09,919 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:52:09,920 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:52:09,920 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:52:09,921 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/config/svcomp-DataRace-32bit-Taipan_Default.epf [2022-11-03 01:52:09,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:52:09,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:52:09,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:52:09,968 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:52:09,969 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:52:09,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:52:09,970 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:52:09,970 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:52:09,970 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:52:09,971 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:52:09,972 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:52:09,972 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:52:09,972 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:52:09,972 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:52:09,972 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:52:09,973 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:52:09,973 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:52:09,973 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:52:09,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:52:09,974 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:52:09,974 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:52:09,975 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:52:09,975 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:52:09,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:52:09,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 01:52:09,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:52:09,976 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 01:52:09,976 INFO L138 SettingsManager]: * Check absence of data races in concurrent programs=true [2022-11-03 01:52:09,976 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:52:09,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 01:52:09,976 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:52:09,977 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 01:52:09,977 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:52:09,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:52:09,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:09,978 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:52:09,978 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:52:09,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:52:09,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 01:52:09,979 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:52:09,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:52:09,979 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 01:52:09,979 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:52:09,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc [2022-11-03 01:52:10,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:52:10,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:52:10,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:52:10,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:52:10,387 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:52:10,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-03 01:52:10,467 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/data/f4266cbec/0ede4bfd9419410ca60aa532764b372a/FLAGb08fe2deb [2022-11-03 01:52:11,019 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:52:11,022 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2022-11-03 01:52:11,033 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/data/f4266cbec/0ede4bfd9419410ca60aa532764b372a/FLAGb08fe2deb [2022-11-03 01:52:11,351 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/data/f4266cbec/0ede4bfd9419410ca60aa532764b372a [2022-11-03 01:52:11,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:52:11,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:52:11,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:11,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:52:11,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:52:11,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ae2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11, skipping insertion in model container [2022-11-03 01:52:11,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:52:11,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:52:11,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-03 01:52:11,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:11,715 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:52:11,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2022-11-03 01:52:11,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:52:11,806 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:52:11,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11 WrapperNode [2022-11-03 01:52:11,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:52:11,808 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:11,808 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:52:11,808 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:52:11,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,886 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 172 [2022-11-03 01:52:11,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:52:11,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:52:11,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:52:11,890 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:52:11,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,960 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,962 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:52:11,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:52:11,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:52:11,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:52:11,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (1/1) ... [2022-11-03 01:52:11,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:52:12,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:52:12,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:52:12,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:52:12,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:52:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:52:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:52:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 01:52:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-03 01:52:12,065 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-03 01:52:12,065 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-03 01:52:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-03 01:52:12,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-03 01:52:12,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-03 01:52:12,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:52:12,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 01:52:12,066 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 01:52:12,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:52:12,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:52:12,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:52:12,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:52:12,069 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 01:52:12,181 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:52:12,183 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:52:12,835 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:52:12,948 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:52:12,948 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-03 01:52:12,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:12 BoogieIcfgContainer [2022-11-03 01:52:12,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:52:12,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:52:12,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:52:12,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:52:12,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:52:11" (1/3) ... [2022-11-03 01:52:12,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be8d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:12, skipping insertion in model container [2022-11-03 01:52:12,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:52:11" (2/3) ... [2022-11-03 01:52:12,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be8d8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:52:12, skipping insertion in model container [2022-11-03 01:52:12,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:52:12" (3/3) ... [2022-11-03 01:52:12,961 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2022-11-03 01:52:12,981 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 01:52:12,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:52:12,993 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-03 01:52:12,993 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 01:52:13,140 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-03 01:52:13,175 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 01:52:13,189 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 279 places, 285 transitions, 594 flow [2022-11-03 01:52:13,192 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 279 places, 285 transitions, 594 flow [2022-11-03 01:52:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 279 places, 285 transitions, 594 flow [2022-11-03 01:52:13,331 INFO L130 PetriNetUnfolder]: 16/282 cut-off events. [2022-11-03 01:52:13,331 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-03 01:52:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 282 events. 16/282 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2022-11-03 01:52:13,355 INFO L118 LiptonReduction]: Number of co-enabled transitions 6748 [2022-11-03 01:53:23,923 INFO L133 LiptonReduction]: Checked pairs total: 30868 [2022-11-03 01:53:23,924 INFO L135 LiptonReduction]: Total number of compositions: 320 [2022-11-03 01:53:23,933 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 84 places, 83 transitions, 190 flow [2022-11-03 01:53:24,595 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:24,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:53:24,624 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4170eaa9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:53:24,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2022-11-03 01:53:24,747 INFO L276 IsEmpty]: Start isEmpty. Operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 01:53:24,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:24,754 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 01:53:24,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:24,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:24,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1146, now seen corresponding path program 1 times [2022-11-03 01:53:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:24,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467012363] [2022-11-03 01:53:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:24,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:24,900 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:24,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467012363] [2022-11-03 01:53:24,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467012363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:24,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:24,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 01:53:24,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435766540] [2022-11-03 01:53:24,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:24,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 01:53:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 01:53:24,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 01:53:24,970 INFO L87 Difference]: Start difference. First operand has 14904 states, 14251 states have (on average 4.31317100554347) internal successors, (61467), 14903 states have internal predecessors, (61467), 0 states have call successors, (0), 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 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:25,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:25,186 INFO L93 Difference]: Finished difference Result 2335 states and 9159 transitions. [2022-11-03 01:53:25,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 01:53:25,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2022-11-03 01:53:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:25,236 INFO L225 Difference]: With dead ends: 2335 [2022-11-03 01:53:25,237 INFO L226 Difference]: Without dead ends: 2299 [2022-11-03 01:53:25,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-11-03 01:53:25,243 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:25,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:53:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2299 states. [2022-11-03 01:53:25,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2299 to 2299. [2022-11-03 01:53:25,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2295 states have (on average 3.9459694989106753) internal successors, (9056), 2298 states have internal predecessors, (9056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 9056 transitions. [2022-11-03 01:53:25,521 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 9056 transitions. Word has length 1 [2022-11-03 01:53:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:25,521 INFO L495 AbstractCegarLoop]: Abstraction has 2299 states and 9056 transitions. [2022-11-03 01:53:25,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:25,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 9056 transitions. [2022-11-03 01:53:25,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 01:53:25,523 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:25,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:53:25,524 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:25,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:25,525 INFO L85 PathProgramCache]: Analyzing trace with hash -196649751, now seen corresponding path program 1 times [2022-11-03 01:53:25,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:25,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269157331] [2022-11-03 01:53:25,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:25,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:25,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:25,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269157331] [2022-11-03 01:53:25,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269157331] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:25,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:25,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169922290] [2022-11-03 01:53:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:25,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:25,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:25,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:25,988 INFO L87 Difference]: Start difference. First operand 2299 states and 9056 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-11-03 01:53:26,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:26,435 INFO L93 Difference]: Finished difference Result 4351 states and 16554 transitions. [2022-11-03 01:53:26,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:53:26,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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 12 [2022-11-03 01:53:26,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:26,474 INFO L225 Difference]: With dead ends: 4351 [2022-11-03 01:53:26,474 INFO L226 Difference]: Without dead ends: 4351 [2022-11-03 01:53:26,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:26,476 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 160 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:26,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 96 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:26,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2022-11-03 01:53:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 2939. [2022-11-03 01:53:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2935 states have (on average 3.9557069846678026) internal successors, (11610), 2938 states have internal predecessors, (11610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 11610 transitions. [2022-11-03 01:53:26,663 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 11610 transitions. Word has length 12 [2022-11-03 01:53:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:26,664 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 11610 transitions. [2022-11-03 01:53:26,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-11-03 01:53:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 11610 transitions. [2022-11-03 01:53:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:26,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:26,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:26,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:53:26,668 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:26,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -486676423, now seen corresponding path program 1 times [2022-11-03 01:53:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:26,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766356376] [2022-11-03 01:53:26,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:26,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:27,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:27,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:27,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766356376] [2022-11-03 01:53:27,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766356376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:27,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:27,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:27,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76545277] [2022-11-03 01:53:27,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:27,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:27,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:27,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:27,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:27,434 INFO L87 Difference]: Start difference. First operand 2939 states and 11610 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11-03 01:53:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:28,271 INFO L93 Difference]: Finished difference Result 4314 states and 16985 transitions. [2022-11-03 01:53:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:28,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-11-03 01:53:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:28,318 INFO L225 Difference]: With dead ends: 4314 [2022-11-03 01:53:28,318 INFO L226 Difference]: Without dead ends: 4314 [2022-11-03 01:53:28,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:28,323 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 72 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:28,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 67 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:53:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4314 states. [2022-11-03 01:53:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4314 to 3914. [2022-11-03 01:53:28,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3914 states, 3910 states have (on average 4.016624040920716) internal successors, (15705), 3913 states have internal predecessors, (15705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3914 states to 3914 states and 15705 transitions. [2022-11-03 01:53:28,622 INFO L78 Accepts]: Start accepts. Automaton has 3914 states and 15705 transitions. Word has length 14 [2022-11-03 01:53:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:28,639 INFO L495 AbstractCegarLoop]: Abstraction has 3914 states and 15705 transitions. [2022-11-03 01:53:28,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11-03 01:53:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3914 states and 15705 transitions. [2022-11-03 01:53:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 01:53:28,647 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:28,647 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:28,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:53:28,648 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:28,649 INFO L85 PathProgramCache]: Analyzing trace with hash -839938242, now seen corresponding path program 1 times [2022-11-03 01:53:28,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:28,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680695829] [2022-11-03 01:53:28,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:28,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:29,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:29,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680695829] [2022-11-03 01:53:29,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680695829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:29,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:29,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:29,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300672275] [2022-11-03 01:53:29,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:29,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:29,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:29,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:29,163 INFO L87 Difference]: Start difference. First operand 3914 states and 15705 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11-03 01:53:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:30,132 INFO L93 Difference]: Finished difference Result 4867 states and 19601 transitions. [2022-11-03 01:53:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:30,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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 14 [2022-11-03 01:53:30,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:30,187 INFO L225 Difference]: With dead ends: 4867 [2022-11-03 01:53:30,188 INFO L226 Difference]: Without dead ends: 4867 [2022-11-03 01:53:30,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:30,191 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:30,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 57 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 01:53:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2022-11-03 01:53:30,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867. [2022-11-03 01:53:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 4863 states have (on average 4.030639522928234) internal successors, (19601), 4866 states have internal predecessors, (19601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 19601 transitions. [2022-11-03 01:53:30,590 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 19601 transitions. Word has length 14 [2022-11-03 01:53:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:30,590 INFO L495 AbstractCegarLoop]: Abstraction has 4867 states and 19601 transitions. [2022-11-03 01:53:30,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 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-11-03 01:53:30,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 19601 transitions. [2022-11-03 01:53:30,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 01:53:30,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:30,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:30,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:53:30,597 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:30,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:30,597 INFO L85 PathProgramCache]: Analyzing trace with hash 304479873, now seen corresponding path program 1 times [2022-11-03 01:53:30,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:30,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571095390] [2022-11-03 01:53:30,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:30,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:30,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571095390] [2022-11-03 01:53:30,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571095390] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:30,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:53:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058518540] [2022-11-03 01:53:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:53:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:53:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:53:30,851 INFO L87 Difference]: Start difference. First operand 4867 states and 19601 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-11-03 01:53:31,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:31,216 INFO L93 Difference]: Finished difference Result 4746 states and 18607 transitions. [2022-11-03 01:53:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:53:31,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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 17 [2022-11-03 01:53:31,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:31,251 INFO L225 Difference]: With dead ends: 4746 [2022-11-03 01:53:31,251 INFO L226 Difference]: Without dead ends: 4746 [2022-11-03 01:53:31,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:53:31,252 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 77 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:31,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 94 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:53:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4746 states. [2022-11-03 01:53:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4746 to 4674. [2022-11-03 01:53:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 4670 states have (on average 3.95203426124197) internal successors, (18456), 4673 states have internal predecessors, (18456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 18456 transitions. [2022-11-03 01:53:31,522 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 18456 transitions. Word has length 17 [2022-11-03 01:53:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:31,523 INFO L495 AbstractCegarLoop]: Abstraction has 4674 states and 18456 transitions. [2022-11-03 01:53:31,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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-11-03 01:53:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 18456 transitions. [2022-11-03 01:53:31,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:31,528 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:31,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:31,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:53:31,529 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:31,530 INFO L85 PathProgramCache]: Analyzing trace with hash 474819540, now seen corresponding path program 1 times [2022-11-03 01:53:31,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:31,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325515106] [2022-11-03 01:53:31,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:32,401 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:32,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325515106] [2022-11-03 01:53:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325515106] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:32,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:32,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:53:32,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600093478] [2022-11-03 01:53:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:32,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:53:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:53:32,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 01:53:32,403 INFO L87 Difference]: Start difference. First operand 4674 states and 18456 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:33,444 INFO L93 Difference]: Finished difference Result 13639 states and 54276 transitions. [2022-11-03 01:53:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:33,445 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:33,540 INFO L225 Difference]: With dead ends: 13639 [2022-11-03 01:53:33,541 INFO L226 Difference]: Without dead ends: 13639 [2022-11-03 01:53:33,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:53:33,542 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 264 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:33,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 99 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:53:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13639 states. [2022-11-03 01:53:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13639 to 6249. [2022-11-03 01:53:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6249 states, 6245 states have (on average 4.0819855884707765) internal successors, (25492), 6248 states have internal predecessors, (25492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6249 states to 6249 states and 25492 transitions. [2022-11-03 01:53:34,019 INFO L78 Accepts]: Start accepts. Automaton has 6249 states and 25492 transitions. Word has length 19 [2022-11-03 01:53:34,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:34,020 INFO L495 AbstractCegarLoop]: Abstraction has 6249 states and 25492 transitions. [2022-11-03 01:53:34,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6249 states and 25492 transitions. [2022-11-03 01:53:34,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:34,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:34,027 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:34,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 01:53:34,027 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:34,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 413800142, now seen corresponding path program 2 times [2022-11-03 01:53:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:34,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122671730] [2022-11-03 01:53:34,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:34,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:34,746 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:34,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122671730] [2022-11-03 01:53:34,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122671730] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:34,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:34,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:53:34,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389067523] [2022-11-03 01:53:34,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:34,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:53:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:34,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:53:34,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:53:34,748 INFO L87 Difference]: Start difference. First operand 6249 states and 25492 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:35,937 INFO L93 Difference]: Finished difference Result 14993 states and 60740 transitions. [2022-11-03 01:53:35,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:53:35,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:36,154 INFO L225 Difference]: With dead ends: 14993 [2022-11-03 01:53:36,154 INFO L226 Difference]: Without dead ends: 14993 [2022-11-03 01:53:36,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:53:36,155 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 262 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:36,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 125 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-03 01:53:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14993 states. [2022-11-03 01:53:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14993 to 6323. [2022-11-03 01:53:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6323 states, 6319 states have (on average 4.086880835575249) internal successors, (25825), 6322 states have internal predecessors, (25825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:36,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6323 states to 6323 states and 25825 transitions. [2022-11-03 01:53:36,454 INFO L78 Accepts]: Start accepts. Automaton has 6323 states and 25825 transitions. Word has length 19 [2022-11-03 01:53:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:36,454 INFO L495 AbstractCegarLoop]: Abstraction has 6323 states and 25825 transitions. [2022-11-03 01:53:36,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6323 states and 25825 transitions. [2022-11-03 01:53:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:53:36,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:36,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:36,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 01:53:36,464 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -455542452, now seen corresponding path program 1 times [2022-11-03 01:53:36,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:36,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847471157] [2022-11-03 01:53:36,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:36,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:37,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:53:37,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:37,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847471157] [2022-11-03 01:53:37,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847471157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:37,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:37,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:53:37,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882179905] [2022-11-03 01:53:37,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:37,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:53:37,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:37,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:53:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:53:37,358 INFO L87 Difference]: Start difference. First operand 6323 states and 25825 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:38,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:38,328 INFO L93 Difference]: Finished difference Result 5938 states and 24158 transitions. [2022-11-03 01:53:38,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:53:38,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:53:38,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:38,359 INFO L225 Difference]: With dead ends: 5938 [2022-11-03 01:53:38,359 INFO L226 Difference]: Without dead ends: 5938 [2022-11-03 01:53:38,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:53:38,362 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 179 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:38,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 84 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:53:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5938 states. [2022-11-03 01:53:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5938 to 4398. [2022-11-03 01:53:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4398 states, 4396 states have (on average 3.978616924476797) internal successors, (17490), 4397 states have internal predecessors, (17490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 17490 transitions. [2022-11-03 01:53:38,517 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 17490 transitions. Word has length 19 [2022-11-03 01:53:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:38,517 INFO L495 AbstractCegarLoop]: Abstraction has 4398 states and 17490 transitions. [2022-11-03 01:53:38,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 17490 transitions. [2022-11-03 01:53:38,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:53:38,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:38,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:38,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 01:53:38,527 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:38,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:38,527 INFO L85 PathProgramCache]: Analyzing trace with hash 150919233, now seen corresponding path program 1 times [2022-11-03 01:53:38,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:38,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113136733] [2022-11-03 01:53:38,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:38,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:38,774 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:38,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113136733] [2022-11-03 01:53:38,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113136733] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:38,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944102275] [2022-11-03 01:53:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:38,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:38,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:53:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:38,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:53:38,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:39,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:53:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:53:39,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944102275] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:53:39,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [141708010] [2022-11-03 01:53:39,465 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:53:39,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:53:39,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 01:53:39,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3761737] [2022-11-03 01:53:39,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:53:39,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:53:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:39,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:53:39,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:53:39,470 INFO L87 Difference]: Start difference. First operand 4398 states and 17490 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:40,482 INFO L93 Difference]: Finished difference Result 9745 states and 38372 transitions. [2022-11-03 01:53:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:53:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:53:40,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:40,535 INFO L225 Difference]: With dead ends: 9745 [2022-11-03 01:53:40,535 INFO L226 Difference]: Without dead ends: 9745 [2022-11-03 01:53:40,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2022-11-03 01:53:40,539 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 612 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:40,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 350 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:53:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9745 states. [2022-11-03 01:53:40,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9745 to 7831. [2022-11-03 01:53:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7831 states, 7829 states have (on average 4.068080214586793) internal successors, (31849), 7830 states have internal predecessors, (31849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7831 states to 7831 states and 31849 transitions. [2022-11-03 01:53:40,904 INFO L78 Accepts]: Start accepts. Automaton has 7831 states and 31849 transitions. Word has length 22 [2022-11-03 01:53:40,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:40,905 INFO L495 AbstractCegarLoop]: Abstraction has 7831 states and 31849 transitions. [2022-11-03 01:53:40,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:40,905 INFO L276 IsEmpty]: Start isEmpty. Operand 7831 states and 31849 transitions. [2022-11-03 01:53:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:53:40,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:40,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:40,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-03 01:53:41,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:41,148 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1857421902, now seen corresponding path program 1 times [2022-11-03 01:53:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:41,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450843741] [2022-11-03 01:53:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:41,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:53:41,548 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:41,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450843741] [2022-11-03 01:53:41,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450843741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:41,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:53:41,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 01:53:41,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706577520] [2022-11-03 01:53:41,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:41,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 01:53:41,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:41,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 01:53:41,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:41,550 INFO L87 Difference]: Start difference. First operand 7831 states and 31849 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:53:42,209 INFO L93 Difference]: Finished difference Result 7946 states and 32177 transitions. [2022-11-03 01:53:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:53:42,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:53:42,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:53:42,248 INFO L225 Difference]: With dead ends: 7946 [2022-11-03 01:53:42,248 INFO L226 Difference]: Without dead ends: 5973 [2022-11-03 01:53:42,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:53:42,249 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:53:42,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 58 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 01:53:42,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2022-11-03 01:53:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 5973. [2022-11-03 01:53:42,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5973 states, 5971 states have (on average 3.860994808239826) internal successors, (23054), 5972 states have internal predecessors, (23054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5973 states to 5973 states and 23054 transitions. [2022-11-03 01:53:42,504 INFO L78 Accepts]: Start accepts. Automaton has 5973 states and 23054 transitions. Word has length 24 [2022-11-03 01:53:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:53:42,504 INFO L495 AbstractCegarLoop]: Abstraction has 5973 states and 23054 transitions. [2022-11-03 01:53:42,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:53:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5973 states and 23054 transitions. [2022-11-03 01:53:42,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:53:42,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:53:42,514 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:53:42,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:53:42,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:53:42,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:53:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1274078324, now seen corresponding path program 2 times [2022-11-03 01:53:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:53:42,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138792532] [2022-11-03 01:53:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:53:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:53:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:53:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:53:43,596 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:53:43,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138792532] [2022-11-03 01:53:43,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138792532] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:53:43,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189470851] [2022-11-03 01:53:43,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:53:43,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:53:43,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:53:43,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:53:43,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:53:43,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:53:43,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:53:43,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-03 01:53:43,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:53:44,092 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:53:44,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:53:44,197 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:53:44,198 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 11 treesize of output 11 [2022-11-03 01:53:44,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:53:44,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-03 01:53:44,705 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 40 treesize of output 42 [2022-11-03 01:53:44,838 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 52 treesize of output 57 [2022-11-03 01:53:45,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:53:45,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 01:53:45,217 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 101 treesize of output 89 [2022-11-03 01:53:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:53:51,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:53:51,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189470851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:53:51,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:53:51,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2022-11-03 01:53:51,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754202783] [2022-11-03 01:53:51,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:53:51,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 01:53:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:53:51,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 01:53:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=2, NotChecked=0, Total=552 [2022-11-03 01:53:51,386 INFO L87 Difference]: Start difference. First operand 5973 states and 23054 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:01,384 INFO L93 Difference]: Finished difference Result 9552 states and 36808 transitions. [2022-11-03 01:54:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:54:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-03 01:54:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:01,438 INFO L225 Difference]: With dead ends: 9552 [2022-11-03 01:54:01,439 INFO L226 Difference]: Without dead ends: 9367 [2022-11-03 01:54:01,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=275, Invalid=842, Unknown=5, NotChecked=0, Total=1122 [2022-11-03 01:54:01,440 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 233 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:01,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 162 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 562 Invalid, 0 Unknown, 186 Unchecked, 1.4s Time] [2022-11-03 01:54:01,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9367 states. [2022-11-03 01:54:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9367 to 5899. [2022-11-03 01:54:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5899 states, 5897 states have (on average 3.8592504663388163) internal successors, (22758), 5898 states have internal predecessors, (22758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:01,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5899 states to 5899 states and 22758 transitions. [2022-11-03 01:54:01,711 INFO L78 Accepts]: Start accepts. Automaton has 5899 states and 22758 transitions. Word has length 24 [2022-11-03 01:54:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:01,711 INFO L495 AbstractCegarLoop]: Abstraction has 5899 states and 22758 transitions. [2022-11-03 01:54:01,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 5899 states and 22758 transitions. [2022-11-03 01:54:01,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:54:01,724 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:01,724 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:01,760 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:01,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:01,948 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:54:01,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash -60373606, now seen corresponding path program 1 times [2022-11-03 01:54:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:01,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993539028] [2022-11-03 01:54:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:02,206 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:02,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993539028] [2022-11-03 01:54:02,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993539028] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:02,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152743225] [2022-11-03 01:54:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:02,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:02,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:02,210 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:02,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:54:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:02,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:54:02,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:02,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:54:02,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152743225] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1106926491] [2022-11-03 01:54:02,741 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:54:02,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:02,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2022-11-03 01:54:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909989982] [2022-11-03 01:54:02,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:02,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-03 01:54:02,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:02,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-03 01:54:02,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:54:02,746 INFO L87 Difference]: Start difference. First operand 5899 states and 22758 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:03,614 INFO L93 Difference]: Finished difference Result 5107 states and 19234 transitions. [2022-11-03 01:54:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:54:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 01:54:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:03,636 INFO L225 Difference]: With dead ends: 5107 [2022-11-03 01:54:03,636 INFO L226 Difference]: Without dead ends: 5107 [2022-11-03 01:54:03,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:54:03,637 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 348 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 221 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 01:54:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2022-11-03 01:54:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 4779. [2022-11-03 01:54:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4779 states, 4777 states have (on average 3.837764287209546) internal successors, (18333), 4778 states have internal predecessors, (18333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4779 states to 4779 states and 18333 transitions. [2022-11-03 01:54:03,776 INFO L78 Accepts]: Start accepts. Automaton has 4779 states and 18333 transitions. Word has length 26 [2022-11-03 01:54:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:03,776 INFO L495 AbstractCegarLoop]: Abstraction has 4779 states and 18333 transitions. [2022-11-03 01:54:03,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4779 states and 18333 transitions. [2022-11-03 01:54:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:54:03,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:03,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:03,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-03 01:54:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-03 01:54:04,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:54:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1404988261, now seen corresponding path program 2 times [2022-11-03 01:54:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979051527] [2022-11-03 01:54:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:54:05,145 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:05,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979051527] [2022-11-03 01:54:05,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979051527] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:05,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455994719] [2022-11-03 01:54:05,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:54:05,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:05,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:05,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:54:05,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:54:05,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:05,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:54:05,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:05,425 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:54:05,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:54:05,479 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:54:05,480 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 11 treesize of output 11 [2022-11-03 01:54:05,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:54:05,581 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 28 treesize of output 27 [2022-11-03 01:54:05,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:05,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 01:54:05,727 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:05,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 01:54:06,008 INFO L356 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-03 01:54:06,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 01:54:06,026 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 101 treesize of output 89 [2022-11-03 01:54:06,091 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:54:06,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:06,146 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2 3)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)))) is different from false [2022-11-03 01:54:06,291 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse5 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)))))) is different from false [2022-11-03 01:54:06,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset 2 .cse2)) (.cse5 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse7 0) .cse5 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse7) 0)))))) is different from false [2022-11-03 01:54:06,368 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset .cse2 1)) (.cse4 (+ c_~A~0.offset 2 .cse2)) (.cse8 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse6 0) .cse4 0) .cse8 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse6) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse8) 0)))))) is different from false [2022-11-03 01:54:06,575 INFO L356 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-03 01:54:06,575 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 8 case distinctions, treesize of input 81 treesize of output 117 [2022-11-03 01:54:06,606 INFO L356 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-03 01:54:06,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 54 [2022-11-03 01:54:06,647 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:54:06,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:54:06,684 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:54:06,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:54:06,726 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:54:06,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:54:06,779 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-11-03 01:54:06,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455994719] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:06,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077391481] [2022-11-03 01:54:06,780 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:54:06,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:06,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-11-03 01:54:06,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099959393] [2022-11-03 01:54:06,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:06,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:54:06,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:06,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:54:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=232, Unknown=4, NotChecked=140, Total=462 [2022-11-03 01:54:06,782 INFO L87 Difference]: Start difference. First operand 4779 states and 18333 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:14,739 WARN L234 SmtUtils]: Spent 7.58s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:54:16,603 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse8 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse5 .cse4) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse8) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:54:18,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse9 1)) (.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset .cse9)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse9))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse0 .cse5) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0))))) is different from false [2022-11-03 01:54:20,807 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse9 1)) (.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset .cse9)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse9))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse5) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0))))) is different from false [2022-11-03 01:54:23,846 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse4 (+ c_~A~0.offset 2 .cse10)) (.cse9 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse5 .cse7 0) .cse4 0) .cse9 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse7) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse9) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:54:26,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse9 (+ c_~A~0.offset 2 .cse10)) (.cse7 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 1)) (.cse0 (store (store .cse3 .cse9 0) .cse7 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 .cse4) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse7) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse9) 0)))))) is different from false [2022-11-03 01:54:28,271 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse8 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse5 .cse4) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse8) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse6) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:54:30,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse9 1)) (.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset .cse9)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse9))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse5) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 01:54:32,638 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset .cse9 1)) (.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset .cse9)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse9))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse5) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse5) 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse3) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0))))) is different from false [2022-11-03 01:54:34,679 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse4 (+ c_~A~0.offset 2 .cse10)) (.cse9 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse5 .cse7 0) .cse4 0) .cse9 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse7) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse9) 0)))))) is different from false [2022-11-03 01:54:36,757 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse9 (+ c_~A~0.offset 2 .cse10)) (.cse7 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 1)) (.cse0 (store (store .cse3 .cse9 0) .cse7 0))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 .cse4) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse7) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse9) 0)))))) is different from false [2022-11-03 01:54:38,809 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse4 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse8 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse5 .cse4) 0) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse8) 0)) (forall ((v_ArrVal_1025 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1025) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:54:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:54:38,916 INFO L93 Difference]: Finished difference Result 12052 states and 45455 transitions. [2022-11-03 01:54:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:54:38,917 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:54:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:54:38,961 INFO L225 Difference]: With dead ends: 12052 [2022-11-03 01:54:38,961 INFO L226 Difference]: Without dead ends: 12015 [2022-11-03 01:54:38,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 15 IntricatePredicates, 1 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=187, Invalid=559, Unknown=16, NotChecked=960, Total=1722 [2022-11-03 01:54:38,962 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 347 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2416 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:54:38,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 326 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 889 Invalid, 0 Unknown, 2416 Unchecked, 2.2s Time] [2022-11-03 01:54:38,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12015 states. [2022-11-03 01:54:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12015 to 7774. [2022-11-03 01:54:39,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7774 states, 7772 states have (on average 3.9298764796706123) internal successors, (30543), 7773 states have internal predecessors, (30543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7774 states to 7774 states and 30543 transitions. [2022-11-03 01:54:39,235 INFO L78 Accepts]: Start accepts. Automaton has 7774 states and 30543 transitions. Word has length 28 [2022-11-03 01:54:39,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:54:39,236 INFO L495 AbstractCegarLoop]: Abstraction has 7774 states and 30543 transitions. [2022-11-03 01:54:39,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:54:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 7774 states and 30543 transitions. [2022-11-03 01:54:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:54:39,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:54:39,250 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:54:39,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:54:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-03 01:54:39,476 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:54:39,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:54:39,476 INFO L85 PathProgramCache]: Analyzing trace with hash 301628027, now seen corresponding path program 3 times [2022-11-03 01:54:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:54:39,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294031831] [2022-11-03 01:54:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:54:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:54:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:54:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:54:40,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:54:40,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294031831] [2022-11-03 01:54:40,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294031831] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:54:40,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313367611] [2022-11-03 01:54:40,564 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:54:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:54:40,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:54:40,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:54:40,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:54:47,128 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:54:47,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:54:47,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 01:54:47,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:54:47,489 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 15 treesize of output 11 [2022-11-03 01:54:47,557 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 28 treesize of output 27 [2022-11-03 01:54:47,640 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:47,641 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 01:54:47,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:47,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:54:48,232 INFO L356 Elim1Store]: treesize reduction 308, result has 30.3 percent of original size [2022-11-03 01:54:48,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 45 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 147 treesize of output 225 [2022-11-03 01:54:48,496 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:54:48,496 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 01:54:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:54:48,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:54:50,706 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0))) (.cse1 (+ .cse6 c_~C~0.offset)) (.cse2 (+ .cse6 c_~C~0.offset 1)) (.cse3 (+ .cse6 2 c_~C~0.offset)) (.cse4 (+ .cse6 3 c_~C~0.offset)) (.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1210) .cse2 v_ArrVal_1209) .cse3 v_ArrVal_1214) .cse4 v_ArrVal_1212)) c_~A~0.base) (+ c_~A~0.offset .cse5 1)) 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1210) .cse2 v_ArrVal_1209) .cse3 v_ArrVal_1214) .cse4 v_ArrVal_1212)) c_~A~0.base) (+ c_~A~0.offset 2 .cse5)) 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1210) .cse2 v_ArrVal_1209) .cse3 v_ArrVal_1214) .cse4 v_ArrVal_1212)) c_~A~0.base) (+ c_~A~0.offset .cse5)) 0))))) is different from false [2022-11-03 01:54:52,931 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse3 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset 2 .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_1210) (+ .cse7 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse7 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse7 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))))) is different from false [2022-11-03 01:54:55,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse6))) (let ((.cse2 (store (select |c_#race| c_~A~0.base) .cse3 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6 1)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) (+ .cse8 c_~C~0.offset) v_ArrVal_1210) (+ .cse8 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse8 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse8 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)))))))) is different from false [2022-11-03 01:54:58,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse9 (+ c_~A~0.offset .cse6 1)) (.cse3 (+ c_~A~0.offset 2 .cse6))) (let ((.cse2 (store (store (select |c_#race| c_~A~0.base) .cse9 0) .cse3 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) (+ .cse8 c_~C~0.offset) v_ArrVal_1210) (+ .cse8 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse8 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse8 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse9) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))))))) is different from false [2022-11-03 01:54:58,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,735 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,786 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,787 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:58,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:54:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2022-11-03 01:54:59,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313367611] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:54:59,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [951671065] [2022-11-03 01:54:59,131 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:54:59,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:54:59,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2022-11-03 01:54:59,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615145758] [2022-11-03 01:54:59,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:54:59,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 01:54:59,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:54:59,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 01:54:59,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=751, Unknown=4, NotChecked=236, Total=1122 [2022-11-03 01:54:59,133 INFO L87 Difference]: Start difference. First operand 7774 states and 30543 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:02,023 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse10 (+ c_~A~0.offset .cse11 1)) (.cse5 (+ c_~A~0.offset 2 .cse11))) (let ((.cse1 (+ c_~A~0.offset .cse11)) (.cse4 (store (store .cse0 .cse10 0) .cse5 0))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= c_~C~0.offset 0) (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse2 (store |c_#race| c_~A~0.base (store (store (store (store .cse4 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0)))) (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) (+ .cse3 c_~C~0.offset) v_ArrVal_1210) (+ .cse3 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse3 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse3 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse5) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store .cse4 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_1210) (+ .cse7 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse7 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse7 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse4 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 ~C~0.base (store (store (store (store (select .cse8 ~C~0.base) (+ .cse9 c_~C~0.offset) v_ArrVal_1210) (+ .cse9 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse9 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse9 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse10) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:55:04,491 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset 2 .cse11))) (let ((.cse6 (+ c_~A~0.offset .cse11 1)) (.cse2 (store .cse7 .cse3 0)) (.cse8 (+ c_~A~0.offset .cse11))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (<= c_~C~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse6) 0)))) (= (select .cse7 .cse8) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse7 .cse6) 0) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse10 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0)))) (store .cse9 ~C~0.base (store (store (store (store (select .cse9 ~C~0.base) (+ .cse10 c_~C~0.offset) v_ArrVal_1210) (+ .cse10 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse10 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse10 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse8) 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:55:06,915 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse10)) (.cse3 (+ c_~A~0.offset .cse10 1)) (.cse2 (select |c_#race| c_~A~0.base)) (.cse5 (+ c_~A~0.offset .cse10))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (= (select .cse2 .cse4) 0) (<= c_~C~0.offset 0) (= (select .cse2 .cse5) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_1210) (+ .cse7 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse7 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse7 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse2 .cse3) 0) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0)))) (store .cse8 ~C~0.base (store (store (store (store (select .cse8 ~C~0.base) (+ .cse9 c_~C~0.offset) v_ArrVal_1210) (+ .cse9 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse9 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse9 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 01:55:09,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse10 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse9 1)) (.cse1 (+ c_~A~0.offset 2 .cse9)) (.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse0 (+ .cse10 c_~A~0.offset) 0) (+ .cse10 c_~A~0.offset 1) 0) (+ .cse10 c_~A~0.offset 2) 0) (+ .cse10 c_~A~0.offset 3) 0))) (.cse5 (+ .cse10 c_~C~0.offset)) (.cse6 (+ .cse10 c_~C~0.offset 1)) (.cse7 (+ .cse10 2 c_~C~0.offset)) (.cse8 (+ .cse10 3 c_~C~0.offset)) (.cse2 (+ c_~A~0.offset .cse9))) (and (<= c_thread2Thread1of1ForFork0_~i~1 0) (= (select .cse0 .cse1) 0) (<= c_~C~0.offset 0) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse3) 0) (= c_~A~0.offset 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) .cse5 v_ArrVal_1210) .cse6 v_ArrVal_1209) .cse7 v_ArrVal_1214) .cse8 v_ArrVal_1212)) c_~A~0.base) .cse3) 0)) (= c_thread1Thread1of1ForFork2_~i~0 1) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) .cse5 v_ArrVal_1210) .cse6 v_ArrVal_1209) .cse7 v_ArrVal_1214) .cse8 v_ArrVal_1212)) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) .cse5 v_ArrVal_1210) .cse6 v_ArrVal_1209) .cse7 v_ArrVal_1214) .cse8 v_ArrVal_1212)) c_~A~0.base) .cse2) 0))))) is different from false [2022-11-03 01:55:11,625 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse9 (+ c_~A~0.offset .cse6 1)) (.cse3 (+ c_~A~0.offset 2 .cse6))) (let ((.cse2 (store (store (select |c_#race| c_~A~0.base) .cse9 0) .cse3 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) (+ .cse8 c_~C~0.offset) v_ArrVal_1210) (+ .cse8 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse8 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse8 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse9) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (not (<= (+ (div (+ (- c_~A~0.offset) 3 c_~C~0.offset) (- 4)) c_thread1Thread1of1ForFork2_~i~0) 0)))))) is different from false [2022-11-03 01:55:14,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset 2 .cse6))) (let ((.cse2 (store (select |c_#race| c_~A~0.base) .cse3 0))) (and (not (<= (+ (div (+ (- c_~A~0.offset) 3 c_~C~0.offset) (- 4)) c_thread1Thread1of1ForFork2_~i~0 1) 0)) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6 1)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)) (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse7 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset 2 .cse8) 0) (+ c_~A~0.offset 3 .cse8) 0)))) (store .cse7 ~C~0.base (store (store (store (store (select .cse7 ~C~0.base) (+ .cse8 c_~C~0.offset) v_ArrVal_1210) (+ .cse8 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse8 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse8 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)))))))) is different from false [2022-11-03 01:55:16,805 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#race| c_~A~0.base)) (.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ .cse1 c_~C~0.offset) v_ArrVal_1210) (+ .cse1 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse1 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse1 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse3 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (not (<= (+ (div (+ (- c_~A~0.offset) 3 c_~C~0.offset) (- 4)) c_thread1Thread1of1ForFork2_~i~0 1) 0)) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ .cse5 c_~C~0.offset) v_ArrVal_1210) (+ .cse5 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse5 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse5 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset 2 .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_422 Int)) (or (forall ((v_ArrVal_1209 Int) (v_ArrVal_1210 Int) (v_ArrVal_1212 Int) (~C~0.base Int) (v_ArrVal_1214 Int)) (= (select (select (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_422 4))) (let ((.cse6 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0)))) (store .cse6 ~C~0.base (store (store (store (store (select .cse6 ~C~0.base) (+ .cse7 c_~C~0.offset) v_ArrVal_1210) (+ .cse7 c_~C~0.offset 1) v_ArrVal_1209) (+ 2 .cse7 c_~C~0.offset) v_ArrVal_1214) (+ 3 .cse7 c_~C~0.offset) v_ArrVal_1212)))) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_422 0)))))) is different from false [2022-11-03 01:55:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:55:18,837 INFO L93 Difference]: Finished difference Result 12136 states and 46791 transitions. [2022-11-03 01:55:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:55:18,838 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:55:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:55:18,870 INFO L225 Difference]: With dead ends: 12136 [2022-11-03 01:55:18,870 INFO L226 Difference]: Without dead ends: 11988 [2022-11-03 01:55:18,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=212, Invalid=1011, Unknown=11, NotChecked=836, Total=2070 [2022-11-03 01:55:18,872 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 592 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 3223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1725 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:55:18,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 605 Invalid, 3223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1446 Invalid, 0 Unknown, 1725 Unchecked, 3.0s Time] [2022-11-03 01:55:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2022-11-03 01:55:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 8122. [2022-11-03 01:55:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8122 states, 8120 states have (on average 3.9341133004926108) internal successors, (31945), 8121 states have internal predecessors, (31945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8122 states to 8122 states and 31945 transitions. [2022-11-03 01:55:19,113 INFO L78 Accepts]: Start accepts. Automaton has 8122 states and 31945 transitions. Word has length 28 [2022-11-03 01:55:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:55:19,113 INFO L495 AbstractCegarLoop]: Abstraction has 8122 states and 31945 transitions. [2022-11-03 01:55:19,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:55:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8122 states and 31945 transitions. [2022-11-03 01:55:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:55:19,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:55:19,124 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:55:19,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:55:19,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 01:55:19,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:55:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:55:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 301406687, now seen corresponding path program 4 times [2022-11-03 01:55:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:55:19,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454928686] [2022-11-03 01:55:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:55:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:55:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:55:20,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:55:20,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454928686] [2022-11-03 01:55:20,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454928686] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:55:20,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341890406] [2022-11-03 01:55:20,413 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:55:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:55:20,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:55:20,415 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:55:20,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:55:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:55:20,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:55:20,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:55:20,742 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:55:20,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:55:20,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:55:20,773 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 11 treesize of output 11 [2022-11-03 01:55:20,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:55:20,918 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 28 treesize of output 27 [2022-11-03 01:55:20,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:20,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 01:55:21,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:55:21,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 01:55:21,392 INFO L356 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-03 01:55:21,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 01:55:21,409 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 101 treesize of output 89 [2022-11-03 01:55:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:55:25,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:55:26,388 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0))))))) is different from false [2022-11-03 01:55:26,545 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse4))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse4 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2))) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse4 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))))))) is different from false [2022-11-03 01:55:26,618 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse6 1)) (.cse2 (+ c_~A~0.offset 2 .cse6))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) .cse2 0) (+ c_~A~0.offset .cse6 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)))))))) is different from false [2022-11-03 01:55:26,867 INFO L356 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-03 01:55:26,867 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-11-03 01:55:26,896 INFO L356 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-03 01:55:26,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-11-03 01:55:26,909 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 10 treesize of output 3 [2022-11-03 01:55:26,957 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:55:26,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 1 [2022-11-03 01:55:27,005 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:55:27,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:55:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-11-03 01:55:27,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341890406] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:55:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843714761] [2022-11-03 01:55:27,093 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:55:27,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:55:27,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2022-11-03 01:55:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832990111] [2022-11-03 01:55:27,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:55:27,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-03 01:55:27,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:55:27,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-03 01:55:27,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=12, NotChecked=114, Total=506 [2022-11-03 01:55:27,095 INFO L87 Difference]: Start difference. First operand 8122 states and 31945 transitions. Second operand has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-11-03 01:56:25,245 WARN L234 SmtUtils]: Spent 17.72s on a formula simplification. DAG size of input: 53 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:56:27,270 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0))) (and (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0))))))) is different from false [2022-11-03 01:56:29,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse8 1)) (.cse2 (+ c_~A~0.offset 2 .cse8))) (let ((.cse0 (store (store (store .cse5 .cse4 0) .cse2 0) (+ c_~A~0.offset .cse8 3) 0)) (.cse6 (+ c_~A~0.offset .cse8))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (= (select .cse5 .cse6) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse6) 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:56:31,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse8))) (let ((.cse4 (+ c_~A~0.offset .cse8)) (.cse0 (store (store .cse3 .cse2 0) (+ c_~A~0.offset .cse8 3) 0)) (.cse5 (+ c_~A~0.offset .cse8 1))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2))) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (= (select .cse3 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 .cse5) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse4) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:56:33,832 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse8)) (.cse1 (+ c_~A~0.offset 2 .cse8)) (.cse4 (store .cse0 (+ c_~A~0.offset .cse8 3) 0)) (.cse3 (+ c_~A~0.offset .cse8 1))) (and (= (select .cse0 .cse1) 0) (= (select .cse0 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse3) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse4 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse4 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse1) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse4 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 01:56:36,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse6 1)) (.cse2 (+ c_~A~0.offset 2 .cse6))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) .cse2 0) (+ c_~A~0.offset .cse6 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)))))))) is different from false [2022-11-03 01:56:38,169 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse4))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse4 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) .cse2))) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse4 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))))))) is different from false [2022-11-03 01:56:40,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2 3) 0))) (and (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0)) (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_424 Int)) (or (forall ((v_ArrVal_1397 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_424 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1397) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_424 0))))))) is different from false [2022-11-03 01:56:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:56:47,495 INFO L93 Difference]: Finished difference Result 14117 states and 53999 transitions. [2022-11-03 01:56:47,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:56:47,496 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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 28 [2022-11-03 01:56:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:56:47,539 INFO L225 Difference]: With dead ends: 14117 [2022-11-03 01:56:47,539 INFO L226 Difference]: Without dead ends: 14080 [2022-11-03 01:56:47,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 83.9s TimeCoverageRelationStatistics Valid=173, Invalid=527, Unknown=42, NotChecked=590, Total=1332 [2022-11-03 01:56:47,540 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 372 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2171 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 01:56:47,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 373 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 742 Invalid, 0 Unknown, 2171 Unchecked, 1.6s Time] [2022-11-03 01:56:47,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14080 states. [2022-11-03 01:56:47,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14080 to 8847. [2022-11-03 01:56:47,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8847 states, 8845 states have (on average 3.94335782928208) internal successors, (34879), 8846 states have internal predecessors, (34879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:47,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8847 states to 8847 states and 34879 transitions. [2022-11-03 01:56:47,757 INFO L78 Accepts]: Start accepts. Automaton has 8847 states and 34879 transitions. Word has length 28 [2022-11-03 01:56:47,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:56:47,757 INFO L495 AbstractCegarLoop]: Abstraction has 8847 states and 34879 transitions. [2022-11-03 01:56:47,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 22 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-11-03 01:56:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 8847 states and 34879 transitions. [2022-11-03 01:56:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:56:47,771 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:56:47,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:56:47,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:56:47,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 01:56:47,992 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:56:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:56:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash 289384577, now seen corresponding path program 5 times [2022-11-03 01:56:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:56:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474811195] [2022-11-03 01:56:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:56:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:56:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:56:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:56:49,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:56:49,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474811195] [2022-11-03 01:56:49,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474811195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:56:49,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262366804] [2022-11-03 01:56:49,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:56:49,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:56:49,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:56:49,033 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:56:49,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:56:49,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:56:49,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:56:49,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:56:49,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:56:49,356 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:56:49,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:56:49,408 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:56:49,408 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 11 treesize of output 11 [2022-11-03 01:56:49,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:56:49,507 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 28 treesize of output 27 [2022-11-03 01:56:49,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:49,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 01:56:49,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:56:49,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 01:56:49,946 INFO L356 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-03 01:56:49,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 01:56:49,957 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 101 treesize of output 89 [2022-11-03 01:56:50,029 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:56:50,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:56:50,106 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse2 1)))) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse2 3)) 0)))) is different from false [2022-11-03 01:56:50,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse4 3))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse2 0))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse4 1)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset 2 .cse4)) 0)))))) is different from false [2022-11-03 01:56:50,348 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse4)) (.cse6 (+ c_~A~0.offset .cse4 3))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse6 0))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse4 1)) 0)))))) is different from false [2022-11-03 01:56:50,390 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse2 1)) (.cse6 (+ c_~A~0.offset 2 .cse2)) (.cse8 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) .cse6 0) .cse8 0))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse8) 0)))))) is different from false [2022-11-03 01:56:50,622 INFO L356 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-03 01:56:50,622 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-11-03 01:56:50,647 INFO L356 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-03 01:56:50,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-11-03 01:56:50,700 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:56:50,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 1 [2022-11-03 01:56:50,740 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:56:50,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:56:50,783 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:56:50,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:56:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 3 not checked. [2022-11-03 01:56:50,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262366804] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:56:50,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1538080296] [2022-11-03 01:56:50,845 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:56:50,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:56:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-11-03 01:56:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703793781] [2022-11-03 01:56:50,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:56:50,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 01:56:50,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:56:50,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 01:56:50,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=232, Unknown=4, NotChecked=140, Total=462 [2022-11-03 01:56:50,847 INFO L87 Difference]: Start difference. First operand 8847 states and 34879 transitions. Second operand has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:56:57,164 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 57 DAG size of output: 44 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:56:59,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse10)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse0 (store (store .cse3 .cse2 0) .cse8 0)) (.cse6 (+ c_~A~0.offset .cse10 1))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse4) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse3 .cse6) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse8) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:57:01,242 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse2 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse5 .cse7) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:57:03,293 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse9)) (.cse7 (+ c_~A~0.offset .cse9)) (.cse2 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse9 3))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2))) (= (select .cse0 .cse3) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (= (select .cse0 .cse5) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (= (select .cse0 .cse7) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse0 .cse2) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse3) 0))))) is different from false [2022-11-03 01:57:05,299 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse2 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse5 .cse7) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:57:07,449 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse9)) (.cse7 (+ c_~A~0.offset .cse9)) (.cse2 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse9 3))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2))) (= (select .cse0 .cse3) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (= (select .cse0 .cse5) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (= (select .cse0 .cse7) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse3) 0))))) is different from false [2022-11-03 01:57:10,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse5 (+ c_~A~0.offset .cse10 1)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse9 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse3 .cse5 0) .cse7 0) .cse9 0))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse9) 0)))))) is different from false [2022-11-03 01:57:12,561 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse10)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse0 (store (store .cse3 .cse2 0) .cse8 0)) (.cse6 (+ c_~A~0.offset .cse10 1))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse4) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 .cse6) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse8) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:57:14,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse0 (store .cse5 .cse2 0)) (.cse6 (+ c_~A~0.offset 2 .cse10))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (= (select .cse5 .cse6) 0) (= (select .cse5 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse5 .cse7) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:57:16,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse9)) (.cse7 (+ c_~A~0.offset .cse9)) (.cse2 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse9 3))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2))) (= (select .cse0 .cse3) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (= (select .cse0 .cse5) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (= (select .cse0 .cse7) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse3) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 01:57:19,110 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (+ c_~A~0.offset 2 .cse9)) (.cse7 (+ c_~A~0.offset .cse9)) (.cse2 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse9 3))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2))) (= (select .cse0 .cse3) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (= (select .cse0 .cse5) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (= (select .cse0 .cse7) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse3) 0)) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1))))) is different from false [2022-11-03 01:57:21,130 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse5 (+ c_~A~0.offset .cse10 1)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse9 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse3 .cse5 0) .cse7 0) .cse9 0))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse5) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset .cse6 2) 0) (+ c_~A~0.offset .cse6 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse7) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) 0) (+ c_~A~0.offset .cse8 1) 0) (+ c_~A~0.offset .cse8 2) 0) (+ c_~A~0.offset .cse8 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse9) 0)))))) is different from false [2022-11-03 01:57:23,173 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset 2 .cse10)) (.cse8 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse0 (store (store .cse3 .cse2 0) .cse8 0)) (.cse6 (+ c_~A~0.offset .cse10 1))) (and (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse4) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse4) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse3 .cse6) 0) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse8) 0)) (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_1581 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset .cse9 2) 0) (+ c_~A~0.offset .cse9 3) 0))) c_~C~0.base v_ArrVal_1581) c_~A~0.base) .cse6) 0)))))) is different from false [2022-11-03 01:57:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:23,353 INFO L93 Difference]: Finished difference Result 16521 states and 63771 transitions. [2022-11-03 01:57:23,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:57:23,353 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:57:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:23,405 INFO L225 Difference]: With dead ends: 16521 [2022-11-03 01:57:23,405 INFO L226 Difference]: Without dead ends: 16484 [2022-11-03 01:57:23,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=179, Invalid=518, Unknown=17, NotChecked=1008, Total=1722 [2022-11-03 01:57:23,406 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 367 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2061 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:23,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 344 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 865 Invalid, 0 Unknown, 2061 Unchecked, 2.0s Time] [2022-11-03 01:57:23,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16484 states. [2022-11-03 01:57:23,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16484 to 8865. [2022-11-03 01:57:23,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8865 states, 8863 states have (on average 3.9398623490917295) internal successors, (34919), 8864 states have internal predecessors, (34919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 34919 transitions. [2022-11-03 01:57:23,650 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 34919 transitions. Word has length 28 [2022-11-03 01:57:23,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:23,650 INFO L495 AbstractCegarLoop]: Abstraction has 8865 states and 34919 transitions. [2022-11-03 01:57:23,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 34919 transitions. [2022-11-03 01:57:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:57:23,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:23,661 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:23,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:23,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 01:57:23,861 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:57:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:23,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1206719443, now seen corresponding path program 6 times [2022-11-03 01:57:23,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:23,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966697498] [2022-11-03 01:57:23,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:57:24,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:24,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966697498] [2022-11-03 01:57:24,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966697498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:24,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492397908] [2022-11-03 01:57:24,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:57:24,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:24,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:24,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:24,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:57:25,948 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:57:25,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:57:25,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:57:25,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:26,046 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:57:26,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:57:26,158 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:26,158 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 11 treesize of output 11 [2022-11-03 01:57:26,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:57:26,586 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 28 treesize of output 27 [2022-11-03 01:57:26,678 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 40 treesize of output 42 [2022-11-03 01:57:26,806 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 52 treesize of output 57 [2022-11-03 01:57:27,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:27,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 01:57:27,142 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 54 treesize of output 50 [2022-11-03 01:57:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 01:57:27,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:27,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse1 (+ .cse6 c_~A~0.offset)) (.cse2 (+ .cse6 c_~A~0.offset 1)) (.cse3 (+ .cse6 c_~A~0.offset 2)) (.cse4 (+ .cse6 c_~A~0.offset 3)) (.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store .cse0 .cse1 v_ArrVal_1763) .cse2 v_ArrVal_1762) .cse3 v_ArrVal_1765) .cse4 v_ArrVal_1764)) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse5)) 0)) (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store .cse0 .cse1 v_ArrVal_1763) .cse2 v_ArrVal_1762) .cse3 v_ArrVal_1765) .cse4 v_ArrVal_1764)) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset 2 .cse5)) 0)) (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store .cse0 .cse1 v_ArrVal_1763) .cse2 v_ArrVal_1762) .cse3 v_ArrVal_1765) .cse4 v_ArrVal_1764)) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse5 3)) 0)) (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (store (store (store (store .cse0 .cse1 v_ArrVal_1763) .cse2 v_ArrVal_1762) .cse3 v_ArrVal_1765) .cse4 v_ArrVal_1764)) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse5 1)) 0))))) is different from false [2022-11-03 01:57:27,354 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2 3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) v_ArrVal_1763) (+ c_~A~0.offset .cse4 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse4) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse4) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))) is different from false [2022-11-03 01:57:27,489 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse4 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:27,613 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset 2 .cse6)) (.cse2 (+ c_~A~0.offset .cse6 3))) (let ((.cse0 (store (store (select |c_#race| c_~A~0.base) .cse4 0) .cse2 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) v_ArrVal_1763) (+ c_~A~0.offset .cse7 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse7) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse7) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse6 1)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:27,684 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse8 (+ c_~A~0.offset .cse2 1)) (.cse6 (+ c_~A~0.offset 2 .cse2)) (.cse4 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse8 0) .cse6 0) .cse4 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) v_ArrVal_1763) (+ c_~A~0.offset .cse7 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse7) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse7) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse8) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:27,921 INFO L356 Elim1Store]: treesize reduction 704, result has 16.5 percent of original size [2022-11-03 01:57:27,921 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 8 case distinctions, treesize of input 81 treesize of output 153 [2022-11-03 01:57:27,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:27,930 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 117 treesize of output 74 [2022-11-03 01:57:27,960 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 9 treesize of output 3 [2022-11-03 01:57:27,988 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:57:27,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:57:28,015 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:57:28,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:57:28,042 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 01:57:28,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 01:57:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2022-11-03 01:57:28,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492397908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:28,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148337770] [2022-11-03 01:57:28,190 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:57:28,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:28,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 31 [2022-11-03 01:57:28,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029156233] [2022-11-03 01:57:28,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:28,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-03 01:57:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-03 01:57:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=609, Unknown=5, NotChecked=280, Total=1056 [2022-11-03 01:57:28,194 INFO L87 Difference]: Start difference. First operand 8865 states and 34919 transitions. Second operand has 33 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:31,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse9 (+ c_~A~0.offset .cse10 1)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse4 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse5 .cse9 0) .cse7 0) .cse4 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse9) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:33,136 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse5 (+ c_~A~0.offset .cse10 3))) (let ((.cse1 (+ c_~A~0.offset .cse10)) (.cse3 (store (store .cse0 .cse7 0) .cse5 0)) (.cse2 (+ c_~A~0.offset .cse10 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (= c_~A~0.offset 0) (= c_thread1Thread1of1ForFork2_~i~0 1) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse4) v_ArrVal_1763) (+ c_~A~0.offset .cse4 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse4) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse4) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse9) v_ArrVal_1763) (+ c_~A~0.offset .cse9 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse9) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse9) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:35,211 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse6 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse2 (store .cse0 .cse6 0)) (.cse1 (+ c_~A~0.offset 2 .cse10))) (and (= (select .cse0 .cse1) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse7) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse9) v_ArrVal_1763) (+ c_~A~0.offset .cse9 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse9) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse9) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= c_~A~0.offset 0) (= c_thread1Thread1of1ForFork2_~i~0 1))))) is different from false [2022-11-03 01:57:37,403 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset 2 .cse9)) (.cse5 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse9))) (and (= (select .cse0 .cse1) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) v_ArrVal_1763) (+ c_~A~0.offset .cse2 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse2) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse2) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse0 .cse3) 0) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse5) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) v_ArrVal_1763) (+ c_~A~0.offset .cse7 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse7) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse7) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1)))) is different from false [2022-11-03 01:57:39,617 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse9 (+ c_~A~0.offset .cse10 1)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse4 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse5 .cse9 0) .cse7 0) .cse4 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse9) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:57:41,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse5 (+ c_~A~0.offset .cse10 3))) (let ((.cse1 (+ c_~A~0.offset .cse10)) (.cse3 (store (store .cse0 .cse7 0) .cse5 0)) (.cse2 (+ c_~A~0.offset .cse10 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse4) v_ArrVal_1763) (+ c_~A~0.offset .cse4 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse4) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse4) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse3 (+ c_~A~0.offset .cse9) v_ArrVal_1763) (+ c_~A~0.offset .cse9 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse9) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse9) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))))))) is different from false [2022-11-03 01:57:43,934 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse6 (+ c_~A~0.offset .cse10 3))) (let ((.cse4 (+ c_~A~0.offset .cse10)) (.cse7 (+ c_~A~0.offset .cse10 1)) (.cse2 (store .cse0 .cse6 0)) (.cse1 (+ c_~A~0.offset 2 .cse10))) (and (= (select .cse0 .cse1) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) v_ArrVal_1763) (+ c_~A~0.offset .cse5 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse5) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse5) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse7) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse9 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse9) v_ArrVal_1763) (+ c_~A~0.offset .cse9 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse9) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse9) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:57:46,041 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse9 3)) (.cse3 (+ c_~A~0.offset 2 .cse9)) (.cse5 (+ c_~A~0.offset .cse9 1)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse9))) (and (= (select .cse0 .cse1) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) v_ArrVal_1763) (+ c_~A~0.offset .cse2 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse2) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse2) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse0 .cse3) 0) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse5) 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse7) v_ArrVal_1763) (+ c_~A~0.offset .cse7 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse7) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse7) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse5) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 01:57:48,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse5 (select |c_#race| c_~A~0.base)) (.cse9 (+ c_~A~0.offset .cse10 1)) (.cse7 (+ c_~A~0.offset 2 .cse10)) (.cse4 (+ c_~A~0.offset .cse10 3))) (let ((.cse2 (+ c_~A~0.offset .cse10)) (.cse0 (store (store (store .cse5 .cse9 0) .cse7 0) .cse4 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) v_ArrVal_1763) (+ c_~A~0.offset .cse1 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse1) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse1) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) v_ArrVal_1763) (+ c_~A~0.offset .cse3 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse3) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse3) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (= (select .cse5 .cse2) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse6) v_ArrVal_1763) (+ c_~A~0.offset .cse6 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse6) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse6) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_428 Int)) (or (forall ((v_ArrVal_1763 Int) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1762 Int) (v_ArrVal_1765 Int) (v_ArrVal_1764 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse8 (* v_thread2Thread1of1ForFork0_~i~1_428 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse8) v_ArrVal_1763) (+ c_~A~0.offset .cse8 1) v_ArrVal_1762) (+ c_~A~0.offset 2 .cse8) v_ArrVal_1765) (+ c_~A~0.offset 3 .cse8) v_ArrVal_1764))) c_~C~0.base v_ArrVal_1761) c_~A~0.base) .cse9) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_428 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:57:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:57:48,809 INFO L93 Difference]: Finished difference Result 17563 states and 68432 transitions. [2022-11-03 01:57:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-03 01:57:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:57:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:57:48,862 INFO L225 Difference]: With dead ends: 17563 [2022-11-03 01:57:48,863 INFO L226 Difference]: Without dead ends: 17489 [2022-11-03 01:57:48,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=256, Invalid=976, Unknown=14, NotChecked=1106, Total=2352 [2022-11-03 01:57:48,864 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 618 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1773 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:57:48,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 415 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1024 Invalid, 0 Unknown, 1773 Unchecked, 2.0s Time] [2022-11-03 01:57:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17489 states. [2022-11-03 01:57:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17489 to 9754. [2022-11-03 01:57:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9754 states, 9752 states have (on average 3.96052091878589) internal successors, (38623), 9753 states have internal predecessors, (38623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:49,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 38623 transitions. [2022-11-03 01:57:49,129 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 38623 transitions. Word has length 28 [2022-11-03 01:57:49,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:57:49,130 INFO L495 AbstractCegarLoop]: Abstraction has 9754 states and 38623 transitions. [2022-11-03 01:57:49,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.3125) internal successors, (74), 32 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:57:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 38623 transitions. [2022-11-03 01:57:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:57:49,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:57:49,140 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:57:49,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:57:49,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 01:57:49,341 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:57:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:57:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2094958781, now seen corresponding path program 7 times [2022-11-03 01:57:49,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:57:49,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525597832] [2022-11-03 01:57:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:57:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:57:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:57:50,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:57:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525597832] [2022-11-03 01:57:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525597832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:57:50,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550262031] [2022-11-03 01:57:50,254 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 01:57:50,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:57:50,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:57:50,256 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:57:50,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:57:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:57:50,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-03 01:57:50,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:57:50,624 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:57:50,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:57:50,736 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:57:50,736 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 11 treesize of output 11 [2022-11-03 01:57:50,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:57:51,050 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 28 treesize of output 27 [2022-11-03 01:57:51,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 16 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 70 [2022-11-03 01:57:51,284 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 64 treesize of output 56 [2022-11-03 01:57:51,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:51,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2022-11-03 01:57:51,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:57:51,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:57:51,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 86 treesize of output 103 [2022-11-03 01:57:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:57:51,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:57:51,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)))) is different from false [2022-11-03 01:57:51,867 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)))) is different from false [2022-11-03 01:57:51,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse1 1))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) c_~A~0.offset 0) (+ c_~A~0.offset 1) 0) (+ c_~A~0.offset 2) 0) (+ c_~A~0.offset 3) 0)))) (and (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_1939 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1939) c_~A~0.base) .cse2) 0)))))) is different from false [2022-11-03 01:57:52,020 INFO L356 Elim1Store]: treesize reduction 274, result has 18.9 percent of original size [2022-11-03 01:57:52,020 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 6 case distinctions, treesize of input 53 treesize of output 79 [2022-11-03 01:57:52,035 INFO L356 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2022-11-03 01:57:52,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 95 treesize of output 47 [2022-11-03 01:57:52,044 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 10 treesize of output 3 [2022-11-03 01:57:52,067 INFO L356 Elim1Store]: treesize reduction 337, result has 0.3 percent of original size [2022-11-03 01:57:52,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 1 [2022-11-03 01:57:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-11-03 01:57:52,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550262031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:57:52,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [442776612] [2022-11-03 01:57:52,146 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:57:52,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:57:52,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 27 [2022-11-03 01:57:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746680609] [2022-11-03 01:57:52,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:57:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-03 01:57:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:57:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-03 01:57:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=545, Unknown=3, NotChecked=150, Total=812 [2022-11-03 01:57:52,149 INFO L87 Difference]: Start difference. First operand 9754 states and 38623 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:00,154 INFO L93 Difference]: Finished difference Result 20470 states and 80218 transitions. [2022-11-03 01:58:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-03 01:58:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:58:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:00,215 INFO L225 Difference]: With dead ends: 20470 [2022-11-03 01:58:00,215 INFO L226 Difference]: Without dead ends: 19947 [2022-11-03 01:58:00,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 3 DeprecatedPredicates, 1201 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=678, Invalid=2637, Unknown=3, NotChecked=342, Total=3660 [2022-11-03 01:58:00,216 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 632 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 2783 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 3635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 684 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:00,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 730 Invalid, 3635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2783 Invalid, 0 Unknown, 684 Unchecked, 5.7s Time] [2022-11-03 01:58:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19947 states. [2022-11-03 01:58:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19947 to 6993. [2022-11-03 01:58:00,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6993 states, 6991 states have (on average 3.935631526248033) internal successors, (27514), 6992 states have internal predecessors, (27514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6993 states to 6993 states and 27514 transitions. [2022-11-03 01:58:00,470 INFO L78 Accepts]: Start accepts. Automaton has 6993 states and 27514 transitions. Word has length 28 [2022-11-03 01:58:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:00,470 INFO L495 AbstractCegarLoop]: Abstraction has 6993 states and 27514 transitions. [2022-11-03 01:58:00,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6993 states and 27514 transitions. [2022-11-03 01:58:00,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:58:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:00,477 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:00,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:58:00,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 01:58:00,678 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:58:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1545008035, now seen corresponding path program 8 times [2022-11-03 01:58:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:00,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103996486] [2022-11-03 01:58:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:01,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103996486] [2022-11-03 01:58:01,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103996486] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:01,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817032840] [2022-11-03 01:58:01,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:58:01,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:01,534 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:01,536 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:58:01,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 01:58:01,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:58:01,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 01:58:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:58:01,843 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 01:58:01,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 01:58:01,869 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:58:01,870 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 11 treesize of output 11 [2022-11-03 01:58:01,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 01:58:01,991 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 28 treesize of output 27 [2022-11-03 01:58:02,140 INFO L356 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-03 01:58:02,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2022-11-03 01:58:02,159 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 77 treesize of output 69 [2022-11-03 01:58:11,879 INFO L356 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-03 01:58:11,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-03 01:58:15,927 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 01:58:15,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-03 01:58:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:58:15,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:58:16,053 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)))) is different from false [2022-11-03 01:58:16,097 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse4 1))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse2 0))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)))))) is different from false [2022-11-03 01:58:16,279 INFO L356 Elim1Store]: treesize reduction 372, result has 17.1 percent of original size [2022-11-03 01:58:16,279 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 6 case distinctions, treesize of input 66 treesize of output 92 [2022-11-03 01:58:16,297 INFO L356 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-11-03 01:58:16,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 47 [2022-11-03 01:58:16,330 INFO L356 Elim1Store]: treesize reduction 448, result has 0.2 percent of original size [2022-11-03 01:58:16,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 1 [2022-11-03 01:58:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-11-03 01:58:16,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817032840] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:58:16,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1470186539] [2022-11-03 01:58:16,418 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 01:58:16,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:58:16,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-11-03 01:58:16,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365051514] [2022-11-03 01:58:16,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:58:16,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 01:58:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:58:16,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 01:58:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=244, Unknown=7, NotChecked=66, Total=380 [2022-11-03 01:58:16,420 INFO L87 Difference]: Start difference. First operand 6993 states and 27514 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:18,939 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse5 1))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse4) 0)) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse0 .cse2) 0)))) is different from false [2022-11-03 01:58:21,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse5 1))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse4) 0)) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0)))) is different from false [2022-11-03 01:58:35,359 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse6 1))) (let ((.cse2 (store .cse0 .cse4 0)) (.cse1 (+ c_~A~0.offset .cse6))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse4) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse1) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 01:58:41,842 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse4 (+ c_~A~0.offset .cse6 1))) (let ((.cse2 (store .cse0 .cse4 0)) (.cse1 (+ c_~A~0.offset .cse6))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse4) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse1) 0)))))) is different from false [2022-11-03 01:58:43,894 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse5 1))) (and (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2123 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2123) c_~A~0.base) .cse4) 0)) (= (select .cse0 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse2) 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1))))) is different from false [2022-11-03 01:58:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:58:44,090 INFO L93 Difference]: Finished difference Result 12443 states and 47699 transitions. [2022-11-03 01:58:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 01:58:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:58:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:58:44,127 INFO L225 Difference]: With dead ends: 12443 [2022-11-03 01:58:44,127 INFO L226 Difference]: Without dead ends: 12443 [2022-11-03 01:58:44,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=170, Invalid=595, Unknown=19, NotChecked=406, Total=1190 [2022-11-03 01:58:44,128 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 290 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1194 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:58:44,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 415 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 971 Invalid, 0 Unknown, 1194 Unchecked, 2.1s Time] [2022-11-03 01:58:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12443 states. [2022-11-03 01:58:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12443 to 7041. [2022-11-03 01:58:44,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7041 states, 7039 states have (on average 3.933371217502486) internal successors, (27687), 7040 states have internal predecessors, (27687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7041 states to 7041 states and 27687 transitions. [2022-11-03 01:58:44,373 INFO L78 Accepts]: Start accepts. Automaton has 7041 states and 27687 transitions. Word has length 28 [2022-11-03 01:58:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:58:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 7041 states and 27687 transitions. [2022-11-03 01:58:44,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:58:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7041 states and 27687 transitions. [2022-11-03 01:58:44,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:58:44,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:58:44,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:58:44,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-03 01:58:44,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:44,581 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 01:58:44,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:58:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1551898405, now seen corresponding path program 9 times [2022-11-03 01:58:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:58:44,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673228453] [2022-11-03 01:58:44,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:58:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:58:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:58:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 01:58:45,664 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:58:45,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673228453] [2022-11-03 01:58:45,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673228453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:58:45,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323050752] [2022-11-03 01:58:45,664 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:58:45,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:58:45,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:58:45,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:58:45,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:59:01,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:59:01,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:59:01,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-03 01:59:01,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:59:02,144 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 15 treesize of output 11 [2022-11-03 01:59:02,338 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 28 treesize of output 27 [2022-11-03 01:59:02,472 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:59:02,472 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 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 01:59:02,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:59:02,898 INFO L356 Elim1Store]: treesize reduction 308, result has 30.3 percent of original size [2022-11-03 01:59:02,899 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 45 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 147 treesize of output 225 [2022-11-03 01:59:03,117 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:59:03,117 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 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 01:59:03,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-03 01:59:03,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:59:05,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0))) (.cse1 (+ .cse6 c_~C~0.offset)) (.cse2 (+ .cse6 c_~C~0.offset 1)) (.cse3 (+ .cse6 2 c_~C~0.offset)) (.cse4 (+ .cse6 3 c_~C~0.offset)) (.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2311) .cse2 v_ArrVal_2315) .cse3 v_ArrVal_2313) .cse4 v_ArrVal_2303)) c_~A~0.base) (+ c_~A~0.offset .cse5)) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2311) .cse2 v_ArrVal_2315) .cse3 v_ArrVal_2313) .cse4 v_ArrVal_2303)) c_~A~0.base) (+ c_~A~0.offset .cse5 1)) 0)) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2311) .cse2 v_ArrVal_2315) .cse3 v_ArrVal_2313) .cse4 v_ArrVal_2303)) c_~A~0.base) (+ c_~A~0.offset 2 .cse5)) 0))))) is different from false [2022-11-03 01:59:28,148 WARN L234 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:39,641 WARN L234 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 54 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 01:59:41,737 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse3))) (let ((.cse2 (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse6 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ c_~C~0.offset .cse1) v_ArrVal_2311) (+ c_~C~0.offset .cse1 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse1) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse1) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ c_~C~0.offset .cse5) v_ArrVal_2311) (+ c_~C~0.offset .cse5 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse5) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse5) v_ArrVal_2303)))) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))))))) is different from false [2022-11-03 02:03:51,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:51,880 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 02:03:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:03:58,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323050752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:03:58,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [939242106] [2022-11-03 02:03:58,631 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:03:58,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:03:58,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 32 [2022-11-03 02:03:58,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483676834] [2022-11-03 02:03:58,633 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:03:58,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-03 02:03:58,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:03:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-03 02:03:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=855, Unknown=13, NotChecked=122, Total=1122 [2022-11-03 02:03:58,635 INFO L87 Difference]: Start difference. First operand 7041 states and 27687 transitions. Second operand has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:02,220 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset 2 .cse8))) (let ((.cse3 (+ c_~A~0.offset .cse8)) (.cse2 (store (store .cse4 (+ c_~A~0.offset .cse8 1) 0) .cse7 0))) (and (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (<= c_~C~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ c_~C~0.offset .cse1) v_ArrVal_2311) (+ c_~C~0.offset .cse1 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse1) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse1) v_ArrVal_2303)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (= (select .cse4 .cse3) 0) (not (= c_~C~0.base c_~A~0.base)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) (+ c_~C~0.offset .cse6) v_ArrVal_2311) (+ c_~C~0.offset .cse6 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse6) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse6) v_ArrVal_2303)))) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 02:04:04,441 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset 2 .cse8))) (let ((.cse3 (+ c_~A~0.offset .cse8)) (.cse2 (store (store .cse4 (+ c_~A~0.offset .cse8 1) 0) .cse7 0))) (and (<= c_~C~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ c_~C~0.offset .cse1) v_ArrVal_2311) (+ c_~C~0.offset .cse1 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse1) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse1) v_ArrVal_2303)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (= (select .cse4 .cse3) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) (+ c_~C~0.offset .cse6) v_ArrVal_2311) (+ c_~C~0.offset .cse6 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse6) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse6) v_ArrVal_2303)))) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (= c_thread1Thread1of1ForFork2_~i~0 1) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 02:04:07,189 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse10 (* c_thread2Thread1of1ForFork0_~i~1 4)) (.cse9 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse7 (+ c_~A~0.offset .cse9)) (.cse8 (+ c_~A~0.offset .cse9 1)) (.cse2 (store |c_#race| c_~A~0.base (store (store (store (store .cse0 (+ .cse10 c_~A~0.offset) 0) (+ .cse10 c_~A~0.offset 1) 0) (+ .cse10 c_~A~0.offset 2) 0) (+ .cse10 c_~A~0.offset 3) 0))) (.cse3 (+ .cse10 c_~C~0.offset)) (.cse4 (+ .cse10 c_~C~0.offset 1)) (.cse5 (+ .cse10 2 c_~C~0.offset)) (.cse6 (+ .cse10 3 c_~C~0.offset)) (.cse1 (+ c_~A~0.offset 2 .cse9))) (and (<= c_thread2Thread1of1ForFork0_~i~1 0) (= (select .cse0 .cse1) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) .cse3 v_ArrVal_2311) .cse4 v_ArrVal_2315) .cse5 v_ArrVal_2313) .cse6 v_ArrVal_2303)) c_~A~0.base) .cse7) 0)) (<= c_~C~0.offset 0) (= (select .cse0 .cse7) 0) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) .cse3 v_ArrVal_2311) .cse4 v_ArrVal_2315) .cse5 v_ArrVal_2313) .cse6 v_ArrVal_2303)) c_~A~0.base) .cse8) 0)) (not (= c_~C~0.base c_~A~0.base)) (= (select .cse0 .cse8) 0) (= c_~A~0.offset 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (= c_thread1Thread1of1ForFork2_~i~0 1) (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (store .cse2 ~C~0.base (store (store (store (store (select .cse2 ~C~0.base) .cse3 v_ArrVal_2311) .cse4 v_ArrVal_2315) .cse5 v_ArrVal_2313) .cse6 v_ArrVal_2303)) c_~A~0.base) .cse1) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 02:04:10,000 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse6 (+ c_~A~0.offset 2 .cse3))) (let ((.cse2 (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse3 1) 0) .cse6 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ c_~C~0.offset .cse1) v_ArrVal_2311) (+ c_~C~0.offset .cse1 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse1) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse1) v_ArrVal_2303)))) c_~A~0.base) (+ c_~A~0.offset .cse3)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse4 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset 2 .cse5) 0) (+ c_~A~0.offset 3 .cse5) 0)))) (store .cse4 ~C~0.base (store (store (store (store (select .cse4 ~C~0.base) (+ c_~C~0.offset .cse5) v_ArrVal_2311) (+ c_~C~0.offset .cse5 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse5) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse5) v_ArrVal_2303)))) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (not (<= (+ (div (+ (- c_~A~0.offset) 3 c_~C~0.offset) (- 4)) c_thread1Thread1of1ForFork2_~i~0) 0)))))) is different from false [2022-11-03 02:04:13,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (select |c_#race| c_~A~0.base)) (.cse7 (+ c_~A~0.offset 2 .cse8))) (let ((.cse3 (+ c_~A~0.offset .cse8)) (.cse2 (store (store .cse4 (+ c_~A~0.offset .cse8 1) 0) .cse7 0))) (and (<= c_~C~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset 2 .cse1) 0) (+ c_~A~0.offset 3 .cse1) 0)))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) (+ c_~C~0.offset .cse1) v_ArrVal_2311) (+ c_~C~0.offset .cse1 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse1) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse1) v_ArrVal_2303)))) c_~A~0.base) .cse3) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (= (select .cse4 .cse3) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_434 Int)) (or (forall ((v_ArrVal_2311 Int) (v_ArrVal_2313 Int) (v_ArrVal_2315 Int) (~C~0.base Int) (v_ArrVal_2303 Int)) (= (select (select (let ((.cse6 (* v_thread2Thread1of1ForFork0_~i~1_434 4))) (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store .cse2 (+ c_~A~0.offset .cse6) 0) (+ c_~A~0.offset .cse6 1) 0) (+ c_~A~0.offset 2 .cse6) 0) (+ c_~A~0.offset 3 .cse6) 0)))) (store .cse5 ~C~0.base (store (store (store (store (select .cse5 ~C~0.base) (+ c_~C~0.offset .cse6) v_ArrVal_2311) (+ c_~C~0.offset .cse6 1) v_ArrVal_2315) (+ 2 c_~C~0.offset .cse6) v_ArrVal_2313) (+ 3 c_~C~0.offset .cse6) v_ArrVal_2303)))) c_~A~0.base) .cse7) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_434 0)))) (not (<= (+ (div (+ (- c_~A~0.offset) 3 c_~C~0.offset) (- 4)) c_thread1Thread1of1ForFork2_~i~0) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 02:04:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:14,402 INFO L93 Difference]: Finished difference Result 16635 states and 64598 transitions. [2022-11-03 02:04:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-03 02:04:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 02:04:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:14,457 INFO L225 Difference]: With dead ends: 16635 [2022-11-03 02:04:14,457 INFO L226 Difference]: Without dead ends: 16450 [2022-11-03 02:04:14,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 57.0s TimeCoverageRelationStatistics Valid=273, Invalid=1459, Unknown=18, NotChecked=602, Total=2352 [2022-11-03 02:04:14,458 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 863 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 1896 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 4265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2227 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:14,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 688 Invalid, 4265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1896 Invalid, 0 Unknown, 2227 Unchecked, 4.1s Time] [2022-11-03 02:04:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2022-11-03 02:04:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 7491. [2022-11-03 02:04:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7491 states, 7489 states have (on average 3.9408465749766326) internal successors, (29513), 7490 states have internal predecessors, (29513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7491 states to 7491 states and 29513 transitions. [2022-11-03 02:04:14,700 INFO L78 Accepts]: Start accepts. Automaton has 7491 states and 29513 transitions. Word has length 28 [2022-11-03 02:04:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:14,700 INFO L495 AbstractCegarLoop]: Abstraction has 7491 states and 29513 transitions. [2022-11-03 02:04:14,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 33 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7491 states and 29513 transitions. [2022-11-03 02:04:14,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:04:14,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:14,708 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:14,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:14,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:14,909 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 02:04:14,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:14,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1552119745, now seen corresponding path program 10 times [2022-11-03 02:04:14,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:14,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524881188] [2022-11-03 02:04:14,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:14,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:16,003 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:04:16,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524881188] [2022-11-03 02:04:16,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524881188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:16,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700694156] [2022-11-03 02:04:16,004 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-03 02:04:16,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:16,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:16,005 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:16,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:04:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:16,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 02:04:16,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:16,346 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 02:04:16,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 02:04:16,375 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:16,375 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 11 treesize of output 11 [2022-11-03 02:04:16,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:04:16,572 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 28 treesize of output 27 [2022-11-03 02:04:16,680 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:16,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-03 02:04:16,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:04:16,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2022-11-03 02:04:17,043 INFO L356 Elim1Store]: treesize reduction 700, result has 6.4 percent of original size [2022-11-03 02:04:17,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 113 [2022-11-03 02:04:17,052 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 101 treesize of output 89 [2022-11-03 02:04:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:04:21,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:21,244 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse2 c_~A~0.offset) 0) (+ .cse2 c_~A~0.offset 1) 0) (+ .cse2 c_~A~0.offset 2) 0) (+ .cse2 c_~A~0.offset 3) 0)))) (.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 3)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)))) is different from false [2022-11-03 02:04:21,605 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset 2 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) (+ c_~A~0.offset .cse1 3) 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))))) (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2) 0)))))) is different from false [2022-11-03 02:04:21,665 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (+ c_~A~0.offset .cse1 1)) (.cse2 (+ c_~A~0.offset 2 .cse1))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse4 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse3 0) .cse2 0) (+ c_~A~0.offset .cse1 3) 0) (+ .cse4 c_~A~0.offset) 0) (+ .cse4 c_~A~0.offset 1) 0) (+ .cse4 c_~A~0.offset 2) 0) (+ .cse4 c_~A~0.offset 3) 0))))) (and (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse3) 0)))))) is different from false [2022-11-03 02:04:21,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse4 (+ c_~A~0.offset .cse6 1)) (.cse2 (+ c_~A~0.offset 2 .cse6))) (let ((.cse0 (store (store (store (select |c_#race| c_~A~0.base) .cse4 0) .cse2 0) (+ c_~A~0.offset .cse6 3) 0))) (and (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse2) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) (+ c_~A~0.offset .cse6)) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))))))) is different from false [2022-11-03 02:04:21,998 INFO L356 Elim1Store]: treesize reduction 740, result has 12.2 percent of original size [2022-11-03 02:04:21,998 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 8 case distinctions, treesize of input 82 treesize of output 118 [2022-11-03 02:04:22,020 INFO L356 Elim1Store]: treesize reduction 216, result has 0.5 percent of original size [2022-11-03 02:04:22,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2022-11-03 02:04:22,028 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 10 treesize of output 3 [2022-11-03 02:04:22,062 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 02:04:22,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 1 [2022-11-03 02:04:22,094 INFO L356 Elim1Store]: treesize reduction 842, result has 0.1 percent of original size [2022-11-03 02:04:22,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2022-11-03 02:04:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2022-11-03 02:04:22,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700694156] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:04:22,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [216871152] [2022-11-03 02:04:22,168 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:04:22,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:04:22,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2022-11-03 02:04:22,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043860325] [2022-11-03 02:04:22,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:04:22,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:04:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:04:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:04:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=321, Unknown=9, NotChecked=164, Total=600 [2022-11-03 02:04:22,171 INFO L87 Difference]: Start difference. First operand 7491 states and 29513 transitions. Second operand has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:34,132 WARN L234 SmtUtils]: Spent 11.75s on a formula simplification. DAG size of input: 60 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:04:37,250 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse6 (+ c_~A~0.offset .cse8 1)) (.cse4 (+ c_~A~0.offset 2 .cse8))) (let ((.cse2 (store (store (store .cse0 .cse6 0) .cse4 0) (+ c_~A~0.offset .cse8 3) 0)) (.cse1 (+ c_~A~0.offset .cse8))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse4) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse6) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))) (forall ((v_thread2Thread1of1ForFork0_~i~1_436 Int)) (or (forall ((v_ArrVal_2497 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse7 (* v_thread2Thread1of1ForFork0_~i~1_436 4))) (store (store (store (store .cse2 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset .cse7 2) 0) (+ c_~A~0.offset .cse7 3) 0))) c_~C~0.base v_ArrVal_2497) c_~A~0.base) .cse1) 0)) (not (<= v_thread2Thread1of1ForFork0_~i~1_436 0)))) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 02:04:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:04:42,971 INFO L93 Difference]: Finished difference Result 15701 states and 61332 transitions. [2022-11-03 02:04:42,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-03 02:04:42,971 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 02:04:42,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:04:43,020 INFO L225 Difference]: With dead ends: 15701 [2022-11-03 02:04:43,020 INFO L226 Difference]: Without dead ends: 15664 [2022-11-03 02:04:43,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=209, Invalid=786, Unknown=17, NotChecked=320, Total=1332 [2022-11-03 02:04:43,021 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 502 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1073 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:04:43,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 380 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 793 Invalid, 0 Unknown, 1073 Unchecked, 1.7s Time] [2022-11-03 02:04:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15664 states. [2022-11-03 02:04:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15664 to 8007. [2022-11-03 02:04:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8007 states, 8005 states have (on average 3.9510306058713303) internal successors, (31628), 8006 states have internal predecessors, (31628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8007 states to 8007 states and 31628 transitions. [2022-11-03 02:04:43,240 INFO L78 Accepts]: Start accepts. Automaton has 8007 states and 31628 transitions. Word has length 28 [2022-11-03 02:04:43,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:04:43,240 INFO L495 AbstractCegarLoop]: Abstraction has 8007 states and 31628 transitions. [2022-11-03 02:04:43,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 24 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:04:43,240 INFO L276 IsEmpty]: Start isEmpty. Operand 8007 states and 31628 transitions. [2022-11-03 02:04:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:04:43,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:04:43,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:04:43,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:04:43,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:43,448 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 02:04:43,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:04:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1543224097, now seen corresponding path program 11 times [2022-11-03 02:04:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:04:43,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180211616] [2022-11-03 02:04:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:04:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:04:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:04:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:04:44,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:04:44,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180211616] [2022-11-03 02:04:44,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180211616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:04:44,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306232945] [2022-11-03 02:04:44,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:04:44,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:04:44,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:04:44,418 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:04:44,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:04:44,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-03 02:04:44,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:04:44,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-03 02:04:44,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:04:44,768 INFO L356 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-11-03 02:04:44,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2022-11-03 02:04:44,818 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 02:04:44,819 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 11 treesize of output 11 [2022-11-03 02:04:44,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-03 02:04:44,929 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 28 treesize of output 27 [2022-11-03 02:04:45,059 INFO L356 Elim1Store]: treesize reduction 352, result has 6.4 percent of original size [2022-11-03 02:04:45,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2022-11-03 02:04:45,064 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 77 treesize of output 69 [2022-11-03 02:04:55,734 INFO L356 Elim1Store]: treesize reduction 235, result has 17.0 percent of original size [2022-11-03 02:04:55,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 87 treesize of output 101 [2022-11-03 02:04:59,354 INFO L356 Elim1Store]: treesize reduction 289, result has 14.2 percent of original size [2022-11-03 02:04:59,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 25 case distinctions, treesize of input 99 treesize of output 116 [2022-11-03 02:04:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 02:04:59,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:04:59,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| c_~A~0.base)) (.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) (+ c_~A~0.offset .cse2)) 0)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)))) is different from false [2022-11-03 02:05:01,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse2 (+ c_~A~0.offset .cse4 1))) (let ((.cse0 (store (select |c_#race| c_~A~0.base) .cse2 0))) (and (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse3 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset .cse3 2) 0) (+ c_~A~0.offset .cse3 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) (+ c_~A~0.offset .cse4)) 0)))))) is different from false [2022-11-03 02:05:01,641 INFO L356 Elim1Store]: treesize reduction 372, result has 17.1 percent of original size [2022-11-03 02:05:01,641 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 6 case distinctions, treesize of input 66 treesize of output 92 [2022-11-03 02:05:01,655 INFO L356 Elim1Store]: treesize reduction 108, result has 0.9 percent of original size [2022-11-03 02:05:01,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 47 [2022-11-03 02:05:01,682 INFO L356 Elim1Store]: treesize reduction 448, result has 0.2 percent of original size [2022-11-03 02:05:01,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 1 [2022-11-03 02:05:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 1 not checked. [2022-11-03 02:05:01,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306232945] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:05:01,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1730232994] [2022-11-03 02:05:01,723 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1621) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-03 02:05:01,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:05:01,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-11-03 02:05:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995946691] [2022-11-03 02:05:01,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:05:01,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-03 02:05:01,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:05:01,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-03 02:05:01,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=8, NotChecked=66, Total=380 [2022-11-03 02:05:01,725 INFO L87 Difference]: Start difference. First operand 8007 states and 31628 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:03,443 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse6 1))) (let ((.cse0 (store .cse3 .cse2 0)) (.cse4 (+ c_~A~0.offset .cse6))) (and (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse2) 0)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (= (select .cse3 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (= c_thread1Thread1of1ForFork2_~i~0 0) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse4) 0)))))) is different from false [2022-11-03 02:05:05,436 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse5 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse1) 0)) (= c_thread1Thread1of1ForFork2_~i~0 0) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse3) 0))))) is different from false [2022-11-03 02:05:07,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse6 1))) (let ((.cse0 (store .cse3 .cse2 0)) (.cse4 (+ c_~A~0.offset .cse6))) (and (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse4) 0)))))) is different from false [2022-11-03 02:05:09,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse5 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse1) 0)) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse3) 0))))) is different from false [2022-11-03 02:05:11,387 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse3 (select |c_#race| c_~A~0.base)) (.cse2 (+ c_~A~0.offset .cse6 1))) (let ((.cse0 (store .cse3 .cse2 0)) (.cse4 (+ c_~A~0.offset .cse6))) (and (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse2) 0)) (= (select .cse3 .cse4) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse5 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse4) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0))))) is different from false [2022-11-03 02:05:13,446 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse5 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse1) 0)) (= (select .cse0 .cse3) 0) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse3) 0)) (<= 1 c_thread1Thread1of1ForFork2_~i~0)))) is different from false [2022-11-03 02:05:15,636 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse5)) (.cse0 (select |c_#race| c_~A~0.base)) (.cse3 (+ c_~A~0.offset .cse5 1))) (and (= (select .cse0 .cse1) 0) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse2 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset .cse2 2) 0) (+ c_~A~0.offset .cse2 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse1) 0)) (= (select .cse0 .cse3) 0) (not (<= c_thread1Thread1of1ForFork2_~i~0 c_thread2Thread1of1ForFork0_~i~1)) (forall ((v_ArrVal_2674 (Array Int Int)) (thread2Thread1of1ForFork0_~i~1 Int)) (= (select (select (store (store |c_#race| c_~A~0.base (let ((.cse4 (* thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store .cse0 (+ c_~A~0.offset .cse4) 0) (+ c_~A~0.offset .cse4 1) 0) (+ c_~A~0.offset .cse4 2) 0) (+ c_~A~0.offset .cse4 3) 0))) c_~C~0.base v_ArrVal_2674) c_~A~0.base) .cse3) 0))))) is different from false [2022-11-03 02:05:15,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:05:15,810 INFO L93 Difference]: Finished difference Result 16992 states and 65957 transitions. [2022-11-03 02:05:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-03 02:05:15,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 02:05:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:05:15,855 INFO L225 Difference]: With dead ends: 16992 [2022-11-03 02:05:15,855 INFO L226 Difference]: Without dead ends: 16989 [2022-11-03 02:05:15,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=101, Invalid=340, Unknown=15, NotChecked=414, Total=870 [2022-11-03 02:05:15,856 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 280 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1077 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:05:15,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 523 Invalid, 0 Unknown, 1077 Unchecked, 0.9s Time] [2022-11-03 02:05:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16989 states. [2022-11-03 02:05:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16989 to 9511. [2022-11-03 02:05:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9511 states, 9509 states have (on average 3.9858029235461143) internal successors, (37901), 9510 states have internal predecessors, (37901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:16,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9511 states to 9511 states and 37901 transitions. [2022-11-03 02:05:16,089 INFO L78 Accepts]: Start accepts. Automaton has 9511 states and 37901 transitions. Word has length 28 [2022-11-03 02:05:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:05:16,089 INFO L495 AbstractCegarLoop]: Abstraction has 9511 states and 37901 transitions. [2022-11-03 02:05:16,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:05:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 9511 states and 37901 transitions. [2022-11-03 02:05:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:05:16,096 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:05:16,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:05:16,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:05:16,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 02:05:16,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2022-11-03 02:05:16,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:05:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1550114467, now seen corresponding path program 12 times [2022-11-03 02:05:16,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:05:16,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2827181] [2022-11-03 02:05:16,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:05:16,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:05:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:05:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:05:17,187 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:05:17,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2827181] [2022-11-03 02:05:17,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2827181] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:05:17,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628889158] [2022-11-03 02:05:17,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 02:05:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:05:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:05:17,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:05:17,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d2cd000f-0f5c-4f1a-9bb0-27ff698f57fe/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:05:23,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 02:05:23,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:05:23,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-03 02:05:23,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:05:24,005 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 16 treesize of output 12 [2022-11-03 02:05:24,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:24,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 58 [2022-11-03 02:05:24,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:24,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 73 [2022-11-03 02:05:24,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:24,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 88 [2022-11-03 02:05:24,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:24,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,005 INFO L356 Elim1Store]: treesize reduction 274, result has 30.6 percent of original size [2022-11-03 02:05:25,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 45 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 29 case distinctions, treesize of input 142 treesize of output 211 [2022-11-03 02:05:25,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:05:25,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:05:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 122 treesize of output 127 [2022-11-03 02:05:25,519 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:05:25,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:05:27,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread2Thread1of1ForFork0_~i~1 4))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ .cse6 c_~A~0.offset) 0) (+ .cse6 c_~A~0.offset 1) 0) (+ .cse6 c_~A~0.offset 2) 0) (+ .cse6 c_~A~0.offset 3) 0))) (.cse1 (+ .cse6 c_~C~0.offset)) (.cse2 (+ .cse6 c_~C~0.offset 1)) (.cse3 (+ .cse6 2 c_~C~0.offset)) (.cse4 (+ .cse6 3 c_~C~0.offset)) (.cse5 (* c_thread1Thread1of1ForFork2_~i~0 4))) (and (forall ((v_ArrVal_2863 Int) (v_ArrVal_2862 Int) (v_ArrVal_2865 Int) (~C~0.base Int) (v_ArrVal_2867 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2863) .cse2 v_ArrVal_2862) .cse3 v_ArrVal_2867) .cse4 v_ArrVal_2865)) c_~A~0.base) (+ c_~A~0.offset .cse5)) 0)) (forall ((v_ArrVal_2863 Int) (v_ArrVal_2862 Int) (v_ArrVal_2865 Int) (~C~0.base Int) (v_ArrVal_2867 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2863) .cse2 v_ArrVal_2862) .cse3 v_ArrVal_2867) .cse4 v_ArrVal_2865)) c_~A~0.base) (+ c_~A~0.offset 2 .cse5)) 0)) (forall ((v_ArrVal_2863 Int) (v_ArrVal_2862 Int) (v_ArrVal_2865 Int) (~C~0.base Int) (v_ArrVal_2867 Int)) (= (select (select (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_2863) .cse2 v_ArrVal_2862) .cse3 v_ArrVal_2867) .cse4 v_ArrVal_2865)) c_~A~0.base) (+ c_~A~0.offset .cse5 1)) 0))))) is different from false [2022-11-03 02:05:48,603 WARN L234 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:06:15,352 WARN L234 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:06:46,143 WARN L234 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 50 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)